Add to ORKG[[abstract]]In this paper, a five-phase solution procedure based on the Tabu search is proposed to solve the dynamic vehicle routing problem with real time demand information. A series of case studies with different characteristics such as demand density, demand size are used to test the solution capability of the proposed algorithm.[[sponsorship]]9th Joint Conference on Information Sciences[[sponsorship]]高雄應用科技大學 JCIS[[notice]]補正完畢[[conferencetype]]國際[[conferencedate]]20061006~20061011[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]高雄, 臺
In this work we formalize a new complex variant of the classical vehicle routing problem arising fro...
Technical Report n. 224, Department of Quantitative Methods, University of Bresci
Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and t...
In this paper, a five-phase solution procedure based on the Tabu search is proposed to solve the dyn...
This paper presents a tabu search based method for finding good solutions to a real-life vehicle rou...
AbstractVehicle Routing Problems have very important applications in the area of distribution manage...
An abundant literature about vehicle routing and scheduling problems is available in the scientific ...
The classical vehicle routing problem (VRP) involves determining affect of homogeneous size vehicles...
This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows....
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a...
In this paper a Tabu Search algorithm has been developed to solve the Vehicle Routing Problem with T...
This paper develops several algorithms based on different variants of tabu search strategy and intro...
This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous d...
The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was...
A framing link (FL) based tabu search algorithm is proposed in this paper for a large-scale multidep...
In this work we formalize a new complex variant of the classical vehicle routing problem arising fro...
Technical Report n. 224, Department of Quantitative Methods, University of Bresci
Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and t...
In this paper, a five-phase solution procedure based on the Tabu search is proposed to solve the dyn...
This paper presents a tabu search based method for finding good solutions to a real-life vehicle rou...
AbstractVehicle Routing Problems have very important applications in the area of distribution manage...
An abundant literature about vehicle routing and scheduling problems is available in the scientific ...
The classical vehicle routing problem (VRP) involves determining affect of homogeneous size vehicles...
This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows....
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a...
In this paper a Tabu Search algorithm has been developed to solve the Vehicle Routing Problem with T...
This paper develops several algorithms based on different variants of tabu search strategy and intro...
This paper discusses a vehicle routing problem with multiple trips, time windows, and simultaneous d...
The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was...
A framing link (FL) based tabu search algorithm is proposed in this paper for a large-scale multidep...
In this work we formalize a new complex variant of the classical vehicle routing problem arising fro...
Technical Report n. 224, Department of Quantitative Methods, University of Bresci
Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and t...