You are here

Home » Content

Optimization of Territories and Transport Routes for Hazardous Materials in a Distribution Network

Journal Name:

  • Journal of Industrial Engineering and Management

Publication Year:

  • 2017
DOI: 
doi.org/10.3926/jiem.2107

Key Words:

Author Name
Abstract (2. Language): 
Purpose: This work presents a general model in mixed integer programming that integrates the design of the territory and distribution route planning, seeking to minimize the total distance covered by the vehicle in each territory. Design/methodology/approach: In this work, a mathematical optimization model has been proposed using an exact algorithm based in mixed integer linear programming, to seek of minimizing the cost of pickups and/or deliveries of products considered to be hazardous in a distribution network, using AMPL software as an interface, with CPLEX as an optimizer to solve a practical real problem. Findings: The model reports an efficient solution, which provide the process administrator with sufficient information to optimize the use of the available (Limited) distribution resources in SMEs of these types of markets that are considered emerging. Originality/value: In contrast to the typical models applied to the VRP with pickups and/or delivery of hazardous materials, this work proposes the use of an exact algorithm that gives a quick and efficient solution for a real optimization problem, considered balance in workload in each territory and using of a single central deposit which the vehicle must use as its origin and final destination.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-optimization-territories-and-transport-routes-hazardous-materials-distribution-network.pdf
  • 4
604
622
  • English

REFERENCES

References: 

Bacao, F., Lobo, V., & Painho, M. (2005). Applying genetic algorithms to zone design. Soft Computing, 9(5),
341-348. https://doi.org/10.1007/s00500-004-0413-4
Beaulieu, M., & Gamache, M. (2006). An enumeration algorithm for solving the fleet management
problem in underground mines. Computers & Operations Research, 33, 1606-1624.
https://doi.org/10.1016/j.cor.2004.11.016
Blais, M., Lapierre, S., & Laporte, G. (2003). Solving a home-care districting problem in an urban setting.
Journal of the Operational Research Society, 54(11), 1141-1147. https://doi.org/10.1057/palgrave.jors.2601625
Bozkaya, B., Erkut, E., & Laporte, G. (2003). A tabu search heuristic and adaptive memory procedure for
political districting. European Journal of Operational Research, 144(1), 12-26. https://doi.org/10.1016/S0377-
2217(01)00380-0
Bueno, A., Cedillo, M., & Velarde, J. (2016). Reliability of the supply chain: method of self-assessment as
a first step to building resilient systems. International Journal of Combinatorial Optimization Problems and
Informatics, 7(1), 3-9.Cedillo, M., De la Riva, J., Bueno, A., Gonzalez, J., & Garcia, J., (2014). Reliability in urban freight
distribution: A Markovian approach. DYNA, 81(187), 232-239. https://doi.org/10.15446/dyna.v81n187.46105
Caro, F., Shirabe, T., Guignard, M., & Weintraub, A. (2004) School redistricting: Embedding GIS tools
with integer programming. Journal of the Operational Research Society, 55(8), 836-849.
https://doi.org/10.1057/palgrave.jors.2601729
Dechampai, D., Tanwanichkul, L., Sethanan, K., & Pitakaso, R. (2015). A differential evolution algorithm
for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum
duration of a route in poultry industry. Journal of Intelligent Manufacturing, 28(6), 1357-1376.
https://doi.org/10.1007/s10845-015-1055-3
D’Amico, S., Wang, S., Batta, R., & Rump, C. (2002). A simulated annealing approach to police district
design. Computers & Operations Research, 29(6), 667-684. https://doi.org/10.1016/S0305-0548(01)00056-9
Drexl, A., & Haase, K. (1999). Fast approximation methods for sales force deployment. Management
Science, 45(10), 1307-1323. https://doi.org/10.1287/mnsc.45.10.1307
Fischetti, M., Toth, P., & Vigo, D. (1994). A Branch-and-Bound algorithm for the capacitated vehicle
routing problem on directed graphs. Informs Operation research, 42(5). https://doi.org/10.1287/opre.42.5.846
Garfinkel, R., & Nemhauser, G. (1970). Solving optimal political districting by implicit enumeration
techniques. Management Science, 16(8), B495-B508. https://doi.org/10.1287/mnsc.16.8.B495
Guedria, M., Malhene, N., & Deschamps, J. (2016). Urban Freight Transport: From Optimized Routes to
Robust Routes. Transportation Research Procedia, 12, 413-424. https://doi.org/10.1016/j.trpro.2016.02.076
Hojati, H. (1996). Optimal political districting. Computers & Operations Research, 23(12). 1147-1161.
https://doi.org/10.1016/S0305-0548(96)00029-9
Jiaoman, D., Xiang, L., Lean, Y., Ralescu, D., & Jiandong, Z. (2017). Multi-depot vehicle routing problema
for hazardous materials transportation: A fuzzy bilevel programming. Information Sciences, 399, 201-218.
https://doi.org/10.1016/j.ins.2017.02.011
Kalcsics, J., Nickel, S., & Schroder, M. (2005). Toward a unified territory design approach Applications,
algorithms, and GIS integration. Top, 13(1), 1-56. https://doi.org/10.1007/BF02578982
Kechmane, L., Nsiri, B., & Baalal, A. (2015). A Mathematical Model to Optimize Transport Cost and
Inventory Level in a Single Level Logistic Network. Computational Problems in Science and Engineering, 343,
271-281. https://doi.org/10.1007/978-3-319-15765-8_15Laporte, G., (2009). Fifty Years of Vehicle Routing. Transportation Science, 43 (4), 408-416.
https://doi.org/10.1287/trsc.1090.0301
Litvinchev, I. (2007). Refinement of lagrangian bounds in optimization problems. Computational
Mathematics and Mathematical Physics, 47(7), 1101-1109. https://doi.org/10.1134/S0965542507070032
Litvinchev, I., Rangel, S., & Saucedo, J. (2008). A Lagrangian bound for many-to-many assignment
problems. Journal of Combinatorial Optimization, 19, 241-257. https://doi.org/10.1007/s10878-008-9196-3
Mingyong, L., & Erbo C. (2010). An improved defferencial evolution algoritnm for vehicle routing
problem wuth simultaneous pickup and deliveries and time windows. Engineering Applications Of Artificial
Intelligence, 23, 188-195. https://doi.org/10.1016/j.engappai.2009.09.001
Mula, J., Peidro, D., Diaz-Madronero, M., & Vicens, E. (2010). Mathematical programming models for
supply chain production and transport planning. European Journal of Operational Research, 204(3), 377-390.
https://doi.org/10.1016/j.ejor.2009.09.008
Nucamendi, S., Cardona, Y., & Bello, A. (2015). Minimizing Customers Waiting Time in a Vehicle Routing
Problem with Unit Demands. Journal of Computer and Systems Sciences International, 54(6), 866-881.
https://doi.org/10.1134/S1064230715040024
Okudea, M., & Taniguchi, E. (2014). Hierarchical traffic network for heuristic approximation method of
vehicle routing problems. Procedia - Social and Behavioral Sciences, 125, 262-274.
https://doi.org/10.1016/j.sbspro.2014.01.1472
Ricca, F., & Simeone, B. (2008). Local search algorithms for political districting. European Journal of
Operational Research, 189(3), 1409-1426. https://doi.org/10.1016/j.ejor.2006.08.065
Ríos, R., & Fernández, E. (2009). A reactive GRASP for a commercial territory design problem with
multiple balancing requirements. Computers & Operations Research, 36(3), 755-776.
https://doi.org/10.1016/j.cor.2007.10.024
Ríos, R., & López, J. (2012). Commercial territory design planning with realignment and disjoint
assignment requirements. Omega, 41, 525-535. https://doi.org/10.1016/j.omega.2012.08.002
Salazar, A., Ríos, R., & Cabrera, M. (2011). New Models for Commercial Territory Design. Springer Science
Business Media, 11, 487-507. https://doi.org/10.1007/s11067-010-9151-6
Serdar, A., & Gen, M. (2012). A genetic algorithm based approach to vehicle routing problem with
simultaneous pick-up and deliveries. Computers & Industrial Engineering, 62, 755-761.
https://doi.org/10.1016/j.cie.2011.11.025Toth, P., & Vigo, D. (2002). The Vehicle Routing Problem, SIAM monographs on discrete mathematics
and applications. Society for Industrial and Applied Mathematics.
Ugurlu, S., Bozkaya, B., & Kervenoael, R. (2013). A New VRPPD Model and a Hybrid Heuristic Solution
Approach for E-Tailing. European Journal of Operational Research, 236(3), 879-890.
Vargas, L., Ríos, R., & López, F. (2005). Usando GRASP para resolver un problema de definición de
territorios de atención comercial. En Arenas, M.G., Herrera, F., Lozano, M., Merelo, J. J., Romero, G., &
Sánchez, A.M. (Eds.). Actas del IV Congreso Español de Metaheurísticas, Algoritmos Evolutivos y Bioinspirados
(MAEB), 609-617.
Wark, P., & Holt, J. (1994). A repeated matching heuristic for the vehicle routing problem. Journal
Operation Research Society, 45, 1156-1167. https://doi.org/10.1057/jors.1994.185

Thank you for copying data from http://www.arastirmax.com