A POPMUSIC matheuristic for the capacitated vehicle routing problem

Queiroga, Eduardo; Sadykov, Ruslan; Uchôa, Eduardo

doi:10.1016/j.cor.2021.105475

Cited by 34 publications

(17 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the computational tests that follow, the Uchoa et al [43] X dataset has been used. Following Queiroga et al [36], this dataset was restricted to its largest 57 instances (called 57-X in what follows).…”

Section: Computational Resultsmentioning

confidence: 99%

“…Finally, Queiroga et al [36] propose a heuristic working as a refinement technique to improve the solution obtained by other heuristics. Exploring a large solution neighborhood, their algorithm is able to consistently improve near-optimal solutions.…”

Section: Previous Workmentioning

confidence: 99%

“…A statistical analysis of percentage gaps obtained for multiple runs on a representative subset of the studied instances has been carried out. From the 57-X dataset, we have chosen seven representative instances selected as suggested by Queiroga et al [36] so as to cover all the different characteristics considered during the generation of the whole X dataset. As to the Belgium dataset, two (Antwerp1 and Flanders1) out of the ten instances have been randomly chosen.…”

Section: Statistical Analysis Of Ls-cghmentioning

confidence: 99%

See 2 more Smart Citations

An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem

Cavaliere

Bendotti²,

Fischetti

2022

Math. Prog. Comp.

View full text Add to dashboard Cite

In this paper, an effective heuristic algorithm for large-scale instances of the Capacitated Vehicle Routing Problem is proposed. The technique consists in a local search method entangled with a restricted Set Partitioning problem optimization. Helsgaun’s LKH-3 algorithm has been used for the local search phase, with a number of implementation improvements. The restricted Set Partitioning formulation is solved by means of an exact commercial Integer Liner Programming solver. The resulting algorithm is able to consistently improve the solutions obtained by a state-of-the-art heuristic from the literature, as well as some of the best-know solutions maintained by the CVRPLIB website.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Previous Workmentioning

confidence: 99%

Section: Statistical Analysis Of Ls-cghmentioning

confidence: 99%

See 1 more Smart Citation

An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem

Cavaliere

Bendotti²,

Fischetti

2022

Math. Prog. Comp.

View full text Add to dashboard Cite

show abstract

“…For larger instances, heuristics are used in practice. In particular, many variants of local search techniques have been proposed; see, e.g., [51,7,1,41,50]. A general overview on various approaches has been given by Toth and Vigo [48].…”

Section: Related Workmentioning

confidence: 99%

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks

Blauth¹,

Held²,

Müller³

et al. 2022

Preprint

View full text Add to dashboard Cite

We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.First, we study basic operations on piecewise linear arrival time functions. In particular, we devise a faster algorithm to compute the pointwise minimum of a set of piecewise linear functions and a monotonicity-preserving variant of the Imai-Iri algorithm to approximate an arrival time function with fewer breakpoints.Next, we show how to evaluate insertion and deletion operations in tours efficiently and update the underlying data structure faster than previously known when a tour changes. Evaluating a tour also requires a scheduling step which is non-trivial in the presence of time windows and time-dependent travel times. We show how to perform this in linear time.Based on these results, we develop a local search heuristic to solve real-world vehicle routing problems with various constraints efficiently and report experimental results on classical benchmarks. Since most of these do not have time-dependent travel times, we generate and publish new benchmark instances that are based on real-world data. This data also demonstrates the importance of considering time-dependent travel times in instances with tight time windows.

show abstract

“…Selain metode eksak, telah banyak metode hampiran/heuristik yang dikembangkan untuk menyelesaikan CVRP, seperti dalam [40] untuk menyelesaikan CVRP Asimetrik. Metode heuristik lainnya di antaranya adalah algoritma simulated annealing [41], algoritma koloni lebah [37], POPMUSIC matheuristic [18], hybrid antara algoritma tabu search dan algoritma tree search [5], dan masih banyak lagi.…”

Section: Tinjauan Pustakaunclassified

Pengoptimuman Biaya Distribusi Menggunakan Integer Programming Dalam Menyikapi Kebijakan Ganjil-Genap Di Jakarta

Aman¹,

Anggraini²,

Hanum³

et al. 2022

MILANG

View full text Add to dashboard Cite

Kebijakan Ganjil-Genap merupakan salah satu aturan yang diterapkan di Jakarta untuk mengurangi kemacetan. Kebijakan ini mengakibatkan kendaraan bermotor tidak bisa melalui ruas jalan tertentu, jika ganjil/genapnya nomor-polisi kendaraan tidak sesuai dengan ganjil/genapnya tanggal kendaraan tersebut ketika melintasi ruas jalan yang terkena kebijakan. Ada beberapa jenis kendaraan yang terkena dampak kebijakan ini, di antaranya ialah kendaraan distribusi perusahaan ekspedisi. Kebijakan ini membuat biaya distribusi perusahaan ekspedisi meningkat karena jarak perjalanan menuju konsumen menjadi lebih jauh untuk menghindari ruas jalan Ganjil-Genap ketika plat nomor polisi kendaraan yang digunakan untuk distribusi tidak sesuai dengan jenis tanggal distribusi. Proses distribusi yang meminimumkan biaya pengeluaran memerlukan penentuan rute yang optimal. Masalah penentuan rute optimal ini diformulasikan ke dalam Vehicle Routing Problem menggunakan Integer Linear Programming. Masalah ini diselesaikan menggunakan perangkat lunak LINGO 18.0 dan solusi optimal yang diperoleh berupa rute pendistribusian barang menggunakan kendaraan tertentu serta meminimumkan biaya distribusi.

show abstract

A POPMUSIC matheuristic for the capacitated vehicle routing problem

Cited by 34 publications

References 34 publications

An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem

An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks

Pengoptimuman Biaya Distribusi Menggunakan Integer Programming Dalam Menyikapi Kebijakan Ganjil-Genap Di Jakarta

Contact Info

Product

Resources

About