• Aucun résultat trouvé

Capacitated Vehicle Routing Problem under Deadlines

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Capacitated Vehicle Routing Problem under Deadlines"

Copied!
9
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Official URL

https://doi.org/10.1109/ICT-DM47966.2019.9033000

Any correspondence concerning this service should be sent to the repository administrator: [email protected]

This is an author’s version published in: http://oatao.univ-toulouse.fr/26356 Open Archive Toulouse Archive Ouverte

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible

To cite this version: Dubois, Florent and Renaud-Goud, Paul and Stolf, Patricia Capacitated Vehicle Routing Problem under Deadlines. (2020) In: International Conference on Information and Communication Technologies for Disaster Management (ICT-DM 2019), 18 December 2019 - 20 December 2019 (Paris, France).

(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)

Références

Télécharger maintenant ( PDF - 9 Page - 5.81 MB )

Documents relatifs

The Multi Trip Vehicle Routing Problem with Time Windows and Release Dates

The Multi Trip Vehicle Routing Problem with Time Windows and Release Dates is a variant of the Multi Trip Vehicle Routing Problem where a time windows is associated with each

A Rich Vehicle Routing Problem with Multiple Trips and Driver Shifts

Keywords: rich vehicle routing problem, column generation, elementary shortest path problem with resource constraints.. This study is concerned with a rich vehicle routing

Recourse policies in the vehicle routing problem with stochastic demands

Vehicle routing problem with stochastic demands refers to pickup/delivery routing problems at operational level of a transportation company. In this variant of the classical

A Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem

In this paper we present an exact algorithm for the Capacitated Location- Routing Problem (CLRP) based on column and cut generation.. The CLRP is formulated as

Metaheuristic for the Generalized Vehicle Routing Problem

The generalized vehicle routing problem (GVRP) involves finding a minimum length set of vehicle routes passing through a set of clusters, where each cluster contains a

Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm

Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm.. Shahin Gelareh, Rahimeh Neamatian Monemi,

Models and Methods for the City Logistics: The Two-Echelon Capacitated Vehicle Routing Problem

Because the main problem- atic arises on transportation cost optimization, a survey of transportation costs optimization is presented in chapter 3, presenting the vehicle

Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows

Keywords: Combinatorial MOP, vehicle routing problem, exact method, column generation This paper presents generic exact methods for the bi-objective vehicle routing problems