research-article

Optimization of Very Large Scale Capacitated Vehicle Routing Problems

Authors:

Komarudin,

Arie ChandraAuthors Info & Claims

ICIBE '19: Proceedings of the 5th International Conference on Industrial and Business Engineering

Pages 18 - 22

https://doi.org/10.1145/3364335.3364389

Published: 27 September 2019 Publication History

Get Access

Abstract

Transportation activity is one of the main contributors to the overall logistics costs of a company. One of the ways to minimize the cost that comes from this activity is through the optimization of the distribution route. However, with the growth of delivery points, the possible routes combinations are growing in a nonlinear fashion, increasing the complexity to obtain the optimal combination of the distribution routes. In this paper, we present a simple modified clarke-wright algorithm with the implementation of heuristic pruning to deal with time and space complexity in a case of very large scale capacitated vehicle routing problem. The resulting algorithm can solve a very large routing problem with several thousand customers within a minute and produce relatively good solutions compared to the state-of-the-art algorithm, especially for the problem with a depot located at the center. Furthermore, the algorithm is also tested to solve a very large scale problem of FMCG company in Indonesia with 32,223 delivery points.

References

[1]

Y. Y. Tseng, W. L. Yue, and M. A. P. Taylor, "The role of transportation in logistics chain," in Eastern Asia Society for Transportation Studies Vol 5, 2005, pp. 1657--1672.

Google Scholar

[2]

Zaroni, "Jalan Panjang Implementasi Green Logistics di Indonesia," 2017. [Online]. Available: http://supplychainindonesia.com/new/jalan-panjang-implementasi-green-logistics-di-indonesia/. [Accessed: 05-Apr-2019].

Google Scholar

[3]

F. Arnold, M. Gendreau, and K. Sörensen, "Efficiently solving very large-scale routing problems," Comput. Oper. Res., vol. 107, pp. 32--42, 2019.

Digital Library

Google Scholar

[4]

J. Kytöjoki, T. Nuortio, O. Bräysy, and M. Gendreau, "An efficient variable neighborhood search heuristic for very large scale vehicle routing problems," Comput. Oper. Res., vol. 34, pp. 2743--2757, 2007.

Digital Library

Google Scholar

[5]

P. Toth and D. Vigo, The Vehicle Routing Problem. Philadelphia: Society for Industrial and Applied Mathematics, 2002.

Crossref

Google Scholar

[6]

F. Arnold, "Efficient Heuristics for Routing and Integrated Logistics," Universiteit Antwerpen, 2018.

Google Scholar

[7]

E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, T. Vidal, and A. Subramanian, "New benchmark instances for the Capacitated Vehicle Routing Problem," Eur. J. Oper. Res., vol. 257, no. 3, pp. 845--858, 2017.

Crossref

Google Scholar

[8]

F. Li, B. Golden, and E. A. Wasil, "Very large-scale vehicle routing: New test problems, algorithms, and results," Comput. Oper. Res., vol. 32, no. 5, pp. 1165--1179, 2005.

Digital Library

Google Scholar

[9]

G. Clarke and J. W. Wright, "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Oper. Res., vol. 12, no. 4, pp. 519--643, 1964.

Digital Library

Google Scholar

[10]

S. Kenneth and D. P. Cuervo, "A critical analysis of the ' improved Clarke and Wright savings algorithm," Int. Trans. Oper. Res., vol. 00, pp. 1--10, 2017.

Google Scholar

[11]

K. Helsgaun, "An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems," 2017.

Google Scholar

Cited By

View all

Gu HWang HJin Y(2023)Surrogate-Assisted Differential Evolution With Adaptive Multisubspace Search for Large-Scale Expensive OptimizationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.322683727:6(1765-1779)Online publication date: Dec-2023
https://doi.org/10.1109/TEVC.2022.3226837
McNulty AOmbuki-Berman BEngelbrecht A(2023)Decomposition and merging cooperative particle swarm optimization with random grouping for large-scale optimization problemsSwarm Intelligence10.1007/s11721-023-00229-0Online publication date: 14-Nov-2023
https://doi.org/10.1007/s11721-023-00229-0
Casté JKoch IMarenco J(2023)Implementing a multi-user framework for vehicle routing problems: a chronicleCentral European Journal of Operations Research10.1007/s10100-023-00856-2Online publication date: 18-May-2023
https://doi.org/10.1007/s10100-023-00856-2
Show More Cited By

Index Terms

Optimization of Very Large Scale Capacitated Vehicle Routing Problems
1. Applied computing
  1. Operations research
    1. Industry and manufacturing
      1. Supply chain management
    2. Transportation

Recommendations

A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

<P>We develop a generic tabu search heuristic for solving the well-known vehicle routing problem. This algorithm explores the advantages of simple local search and improvement heuristics as well as a complex meta-heuristic. The solutions generated by ...
A general heuristic for vehicle routing problems

We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (...
Solving the truck and trailer routing problem based on a simulated annealing heuristic

In this study, we consider the application of a simulated annealing (SA) heuristic to the truck and trailer routing problem (TTRP), a variant of the vehicle routing problem (VRP). In the TTRP, some customers can be serviced by either a complete vehicle (...

Comments

Information & Contributors

Information

Published In

ICIBE '19: Proceedings of the 5th International Conference on Industrial and Business Engineering

September 2019

398 pages

ISBN:9781450376532

DOI:10.1145/3364335

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

The Hong Kong Polytechnic: The Hong Kong Polytechnic University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 September 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Ministry of Research, Technology and Higher Education of the Republic of Indonesia

Conference

ICIBE 2019

ICIBE 2019: 2019 The 5th International Conference on Industrial and Business Engineering

September 27 - 29, 2019

Hong Kong, Hong Kong

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
211
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gu HWang HJin Y(2023)Surrogate-Assisted Differential Evolution With Adaptive Multisubspace Search for Large-Scale Expensive OptimizationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.322683727:6(1765-1779)Online publication date: Dec-2023
https://doi.org/10.1109/TEVC.2022.3226837
McNulty AOmbuki-Berman BEngelbrecht A(2023)Decomposition and merging cooperative particle swarm optimization with random grouping for large-scale optimization problemsSwarm Intelligence10.1007/s11721-023-00229-0Online publication date: 14-Nov-2023
https://doi.org/10.1007/s11721-023-00229-0
Casté JKoch IMarenco J(2023)Implementing a multi-user framework for vehicle routing problems: a chronicleCentral European Journal of Operations Research10.1007/s10100-023-00856-2Online publication date: 18-May-2023
https://doi.org/10.1007/s10100-023-00856-2
Herdianto BKomarudin (2021)Guided Clarke and Wright Algorithm to Solve Large Scale of Capacitated Vehicle Routing Problem2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA)10.1109/ICIEA52957.2021.9436750(449-453)Online publication date: 23-Apr-2021
https://doi.org/10.1109/ICIEA52957.2021.9436750
Costa JMei YZhang M(2020)Cluster-based Hyper-Heuristic for Large-Scale Vehicle Routing Problem2020 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC48606.2020.9185831(1-8)Online publication date: 19-Jul-2020
https://dl.acm.org/doi/10.1109/CEC48606.2020.9185831

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

A general heuristic for vehicle routing problems

Solving the truck and trailer routing problem based on a simulated annealing heuristic

Comments

Information

Published In

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations