Considerations on Set Partitioning and Set Covering Models for Solving the 2E-CVRP in City Logistics: Column Generation and Solution Probleming Analysis - Mines Saint-Étienne Access content directly
Book Sections Year : 2019

Considerations on Set Partitioning and Set Covering Models for Solving the 2E-CVRP in City Logistics: Column Generation and Solution Probleming Analysis

Abstract

This chapter proposes a position viewpoint, discussion, and analysis of various aspects of solving 2E-CVRP problems via exact methods, more precisely the use of set partitioning formulations (and consequently set covering ones), as well as column generation to produce bounds and feed branch-and-prize approaches. After an overview of the main exact methods used to solve 2E-CVRP approaches, the author defines the main notions and variables to model the problem via set covering and set partitioning models. Then the paper presents two methods to generate bounds via column generation: the first is a decomposition approach in which first-echelon and second-echelon routes are generated separately, without any relation, and the second generate sets of linked first-echelon and second-echelon routes. The main implications and considerations of those methods are addressed. Finally, main issues regarding the suitability of exact methods for vehicle routing in city logistics are presented.
No file

Dates and versions

emse-02068028 , version 1 (14-03-2019)

Identifiers

Cite

Jesus Gonzalez-Feliu. Considerations on Set Partitioning and Set Covering Models for Solving the 2E-CVRP in City Logistics: Column Generation and Solution Probleming Analysis. Logistics and Transport Modeling in Urban Goods Movement, pp.88-116, 2019, ⟨10.4018/978-1-5225-8292-2.ch004⟩. ⟨emse-02068028⟩
137 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More