• Aucun résultat trouvé

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

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

Academic year: 2022

Partager "A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier "

Copied!
16
0
0

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

Texte intégral

(1)

___________________________

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

Jean-François Côté

Jean-Yves Potvin May 2007

CIRRELT-2007-08

(2)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

Jean-François Côté

1

,

Jean-Yves Potvin

1*

1.

Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT) and Département d’informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, Canada H3C 3J7

Abstract. This paper describes a tabu search heuristic for a vehicle routing problem where the owner of a private fleet can either visit a customer with one of his vehicles or assign the customer to a common carrier. The owner’s objective is to minimize the variable and fixed costs for operating his fleet plus the total costs charged by the common carrier. The proposed tabu search is shown to outperform the best approach reported in the literature on 34 benchmark instances with homogeneous fleet.

Keywords. Vehicle routing, private fleet, common carrier, tabu search.

Acknowledgements. Financial support for this work was provided by the Natural Sciences and Engineering Research Council of Canada (NSERC). This support is gratefully acknowledged.

Results and views expressed in this publication are the sole responsibility of the authors and do not necessarily reflect those of CIRRELT.

Les résultats et opinions contenus dans cette publication ne reflètent pas nécessairement la position du CIRRELT et n'engagent pas sa responsabilité.

_____________________________

* Corresponding author: potvin@crt.umontreal.ca Dépôt légal – Bibliothèque nationale du Québec, Bibliothèque nationale du Canada, 2007

© Copyright Côté, Potvin and CIRRELT, 2007

(3)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(4)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(5)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(6)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(7)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(8)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(9)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(10)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(11)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(12)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(13)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(14)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(15)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

(16)

A Tabu Search Heuristic for the Vehicle Routing Problem with Private Fleet and Common Carrier

CIRRELT-2007-08

Références

Télécharger maintenant ( PDF - 16 Page - 5.39 MB )

Documents relatifs

A Tabu Search Heuristic for a Sequence-Dependent and Time-Dependent Scheduling Problem on a Single Machine

This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine.. The problem consists

___________________________ A Tabu Search Heuristic for the Split Delivery Vehicle Routing Problem with Production and Demand Calendars

Each customer i has a demand calendar d pit , which specifies the number of new units of product p that must be received in period t (i.e., by the delivery date). A

An Incremental Tabu Search Heuristic for the Generalized Vehicle Routing Problem with Time Windows

This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows.. The purpose of this work is to offer a

An Adaptive Large Neighborhood Search Heuristic for the Cumulative Capacitated Vehicle Routing Problem

All removal heuristics defined in Section 3.1.1 to 3.1.7 first consider the customers of the request bank as removed. So, when the BGI is invoked, the customers not previously

Tabu Search Heuristic for a Two- Echelon Location-Routing Problem

Concerning instead the combination of location and routing solutions of the two echelons, each time a change of the demand assigned to a set of open secondary facilities occurs and

A Tabu Search for the Time-Dependent Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows

The proposed algorithm starts by freely exploring the search space made up of feasible and unfeasible solutions. As the search advances, one lowers the probability of

An Adaptive Large Neighborhood Search Heuristic for a Multi-Period Vehicle Routing Problem

The proposed multi-period model has some similarities to an a priori optimization framework in the context of the vehicle routing problem with stochastic demand (VRPSD). In a

A Hybrid Metaheuristic for the Vehicle Routing Problem with Stochastic

The vehicle routing problem with stochastic demands (VRPSD) consists in designing routes with a minimal expected travel time to satisfy a set of customers with