Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows

View through CrossRef
In the multicommodity two-echelon vehicle routing problem with time windows (MC-2E-VRPTW), first-echelon vehicles transport goods from depots to satellites, whereas second-echelon vehicles ensure that goods are shipped from satellites to customers within their time windows. Given a set of customers, each with demand available at one depot, the MC-2E-VRPTW aims at determining least-cost and capacity-feasible first- and second-echelon routes such that each customer is serviced during its time window by a second-echelon route and has a single first-echelon route supplying its whole demand. For this problem, we propose a route-based formulation that contains an exponential number of variables associated with second-echelon routes and develop a tailored branch-price-and-cut algorithm. This algorithm considers one subproblem per satellite, which is solved by a labeling algorithm to generate second-echelon routes and determine the first-echelon route supplying the load of each visited customer. We devise a recovery procedure to enforce integer solution feasibility in the presence of dual inequalities and propose a branching rule adapted to the multicommodity context. Through extensive computational experiments on benchmark instances, we show that our algorithm outperforms a state-of-the-art algorithm. History: Accepted by Andrea Lodi, Area Editor for Design and Analysis of Algorithms–Discrete. Funding: This work was supported by Natural Sciences and Engineering Research Council of Canada [Discovery Grants 2017-06106 and 2023-03791]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.1010 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.1010 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
Institute for Operations Research and the Management Sciences (INFORMS)
Title: A Branch-Price-and-Cut Algorithm for the Multicommodity Two-Echelon Vehicle Routing Problem with Time Windows
Description:
In the multicommodity two-echelon vehicle routing problem with time windows (MC-2E-VRPTW), first-echelon vehicles transport goods from depots to satellites, whereas second-echelon vehicles ensure that goods are shipped from satellites to customers within their time windows.
Given a set of customers, each with demand available at one depot, the MC-2E-VRPTW aims at determining least-cost and capacity-feasible first- and second-echelon routes such that each customer is serviced during its time window by a second-echelon route and has a single first-echelon route supplying its whole demand.
For this problem, we propose a route-based formulation that contains an exponential number of variables associated with second-echelon routes and develop a tailored branch-price-and-cut algorithm.
This algorithm considers one subproblem per satellite, which is solved by a labeling algorithm to generate second-echelon routes and determine the first-echelon route supplying the load of each visited customer.
We devise a recovery procedure to enforce integer solution feasibility in the presence of dual inequalities and propose a branching rule adapted to the multicommodity context.
Through extensive computational experiments on benchmark instances, we show that our algorithm outperforms a state-of-the-art algorithm.
History: Accepted by Andrea Lodi, Area Editor for Design and Analysis of Algorithms–Discrete.
Funding: This work was supported by Natural Sciences and Engineering Research Council of Canada [Discovery Grants 2017-06106 and 2023-03791].
Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.
informs.
org/doi/suppl/10.
1287/ijoc.
2024.
1010 ) as well as from the IJOC GitHub software repository ( https://github.
com/INFORMSJoC/2024.
1010 ).
The complete IJOC Software and Data Repository is available at https://informsjoc.
github.
io/ .

Related Results

Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router c...
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Abstrak - Penelitian bertujuan untuk dapat membandingkan kinerja protokol routing RIP dan OSPF menggunakan IPv4 bertujuan untuk dapat melakukan perbaingan dua metode touting yaitu ...
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
ABSTRAK Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak ter...
Jaringan Komputer 4 Konfigurasi Routing Dynamic Akhmad Syarifudin 175100012
Jaringan Komputer 4 Konfigurasi Routing Dynamic Akhmad Syarifudin 175100012
Dynamic Routing atau Routing Dynamic (dinamik) adalah sebuah router yang memiliki dan membuat tabel routing secara otomatis. Dengan menggunakan lalu lintas jaringan dan juga salin...
Jaringan Komputer 4 Konfigurasi Routing Dynamic (Akhmad Syarifudin 175100012)
Jaringan Komputer 4 Konfigurasi Routing Dynamic (Akhmad Syarifudin 175100012)
Dynamic Routing atau Routing Dynamic (dinamik) adalah sebuah router yang memiliki dan membuat tabel routing secara otomatis. Dengan menggunakan lalu lintas jaringan dan juga salin...
The multi-depot VRP with vehicle interchanges
The multi-depot VRP with vehicle interchanges
In real-world logistic operations there are a lot of situations that can be exploited to get better operational strategies. It is important to study these new alternatives, because...
Routing Security in Wireless Sensor Networks
Routing Security in Wireless Sensor Networks
Since routing is a fundamental operation in all types of networks, ensuring routing security is a necessary requirement to guarantee the success of routing operation. Securing rout...
Multi-Echelon Inventory Control Optimization Approach for Industrial Applications
Multi-Echelon Inventory Control Optimization Approach for Industrial Applications
Approche d’optimisation de la gestion des stocks multi-échelon pour des applications industrielles Dans cette thèse, nous nous intéressons à l'optimisation d'un pro...

Back to Top