Auteur G. Laporte
|
|
Documents disponibles écrits par cet auteur (7)
Affiner la recherche![]()
Article : texte imprimé
L. Moccia, Auteur ; J.-F. Cordeau, Auteur ; G. Laporte, Auteur |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 general tool that can be successfully applied to a wide variety of spec[...]![]()
Article : texte imprimé
S. Limbourg, Auteur ; M. Schyns, Auteur ; G. Laporte, Auteur |The goal of this paper is the development of a new mixed integer linear program designed for optimally loading a set of containers and pallets into a compartmentalised cargo aircraft. It is based on real-world problems submitted by a professiona[...]![]()
Article : texte imprimé
G. Laporte, Auteur |The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines [...]![]()
Article : texte imprimé
K. Fagerholt, Auteur ; G. Laporte, Auteur ; I. Norstad, Auteur |Fuel consumption and emissions on a shipping route are typically a cubic function of speed. Given a shipping route consisting of a sequence of ports with a time window for the start of service, substantial savings can be achieved by optimizing t[...]![]()
Article : texte imprimé
Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur |This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response [...]![]()
Article : texte imprimé
R. Baldacci, Auteur ; E. Bartolini, Auteur ; G. Laporte, Auteur |The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP[...]![]()
Article : texte imprimé
J. E. Korsvik, Auteur ; K. Fagerholt, Auteur ; G. Laporte, Auteur |The purpose of this paper is to solve a planning problem faced by many shipping companies dealing with the transport of bulk products. These shipping companies are committed to carrying some contract cargoes and will try to derive additional rev[...]


