loading
Documents

Research.Publish.Connect.

Affiliation

Panamerican University, Mexico
Context (please use complete words only)
Field
Sort by

2 Papers

Maximization of Profit for a Problem of Location and Routing, with Price-sensitive Demands

Topics: Optimization; Industrial Engineering; Linear Programming; Network Optimization; Routing; OR in Transportation

Authors: Narda Ibarra-Delgado 1 , Elias Olivares-Benitez 1 , Samuel Nucamendi-Guillén 1 and Omar Rojas 2

Affiliations: 1 Universidad Panamericana, Facultad de Ingenieria, Prolongacion Calzada Circunvalacion Poniente 49, Zapopan, Jalisco, 45010 and Mexico , 2 Universidad Panamericana, Escuela de Ciencias Económicas y Empresariales Prolongacion Calzada Circunvalacion Poniente 49, Zapopan, Jalisco, 45010 and Mexico

Digital Object Identifier: 10.5220/0007405304140421

Proceedings of ICORES 2019, ISBN: 978-989-758-352-0

Collapse Button Quick Abstract
This article seeks to study and solve a problem of profit maximization of a company by defining the location of an optimal number of facilities, allocation and routing of vehicles, and costs for home delivery to meet the demand of its customers. This study is based on an article in which, for the first time, a problem of location and routing and maximization of utilities with price-sensitive demands is integrated. This problem, unlike other studies that only minimize other metrics such as waiting times, route distances, and transportation costs, seeks a greater benefit by increasing profits by discriminating prices depending on the customer's location or adding an additional cost to retail sales. This paper presents a model for small instances based on the model proposed in the aforementioned article. Next, a two-phase heuristic is proposed that solves larger instances with a result close to that obtained in the previous article where a branch-and-price heuristic was used.
Collapse Button Related Ontology Subjects/Areas/Topics (15)
Applications

Linear Programming

OR in Transportation

Artificial Intelligence

Methodologies and Technologies

Pattern Recognition

Industrial Engineering

Network Optimization

Routing

Knowledge Discovery and Information Retrieval

Operational Research

Software Engineering

Knowledge-Based Systems

Optimization

Symbolic Systems

The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach

Topics: Decision Support Systems; Supply Chain Management; Optimization; Industrial Engineering; Linear Programming; Inventory Theory

Authors: Gustavo Macedo-Barragán 1 , Samuel Nucamendi-Guillén 1 , Elías Olivares-Benitez 1 and Omar Rojas 2

Affiliations: 1 Universidad Panamericana, Facultad de Ingeniería, Prolongación Calzada Circunvalación Poniente 49, Zapopan, Jalisco and Mexico , 2 Universidad Panamericana, Escuela de Ciencias Económicas y Empresariales, Prolongación Calzada Circunvalación Poniente 49, Zapopan, Jalisco, 45010 and Mexico

Digital Object Identifier: 10.5220/0007297402290236

Proceedings of ICORES 2019, ISBN: 978-989-758-352-0

Collapse Button Quick Abstract
This article presents a mixed integer linear programming method and a heuristic algorithm to deal with the problem of multi-period, multiple-product batch purchases, with a finite time horizon, considering delivery times, order placement costs and independent batch size for each product. The objective of this problem is to minimize the costs of placing purchase orders and inventory. This problem is motivated by its application in a marketing company that handles the sale of fashion products (footwear and accessories) through catalogs and for which excess inventory represents a major problem given the short life cycle of its products. Experimental results show that the heuristic algorithm is able to obtain feasible solutions that improve in cost by up to 37% the best integer solutions reported by the model when it reaches the time limit. To validate the efficiency of the algorithm, a real scenario was solved for a trading company, obtaining results that improve by 28% compared to the current company’s situation. These results show that the heuristic approach is promising in terms of the quality of the solution and the computational time required.
Collapse Button Related Ontology Subjects/Areas/Topics (19)
Applications

Decision Support Systems, Remote Data Analysis

Linear Programming

Artificial Intelligence

Health Engineering and Technology Applications

Methodologies and Technologies

Business Analytics

Industrial Engineering

Operational Research

Cardiovascular Technologies

Inventory Theory

Optimization

Computing and Telecommunications in Cardiology

Knowledge Discovery and Information Retrieval

Supply Chain Management

Data Engineering

Knowledge-Based Systems

Symbolic Systems
Decision Support Systems

Topic(s):

Filter listed results, by

Author
Locate Author in list below
Add Author(s) to filter:

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic