Similar Search Results

An iterated local search algorithm for the vehicle routing problem with backhauls

Palhazi Cuervo, Daniel; Goos, Peter; Sörensen, Kenneth; … - In: European Journal of Operational Research 237 (2014) 2, pp. 454-464

to the best metaheuristic algorithms for the VRPB. Additionally, new best solutions have been found for two instances in … one of the benchmark sets. These results show that the performance of existing metaheuristic algorithms can be … faster metaheuristic algorithms without compromising the quality of the solutions obtained. …

Persistent link: https://www.econbiz.de/10011097721

Routing a mixed fleet of electric and conventional vehicles

Goeke, Dominik; Schneider, Michael - In: European Journal of Operational Research 245 (2015) 1, pp. 81-99

In this paper, we propose the Electric Vehicle Routing Problem with Time Windows and Mixed Fleet (E-VRPTWMF) to optimize the routing of a mixed fleet of electric commercial vehicles (ECVs) and conventional internal combustion commercial vehicles (ICCVs). Contrary to existing routing models for...

Persistent link: https://www.econbiz.de/10011264311

Talarico, L.; Sörensen, K.; Springael, J. - In: European Journal of Operational Research 244 (2015) 1, pp. 129-140

iterative metaheuristic to generate k dissimilar alternative solutions is also presented. The solution approach is tested using …

Persistent link: https://www.econbiz.de/10011209302

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

Vansteenwegen, Pieter; Mateo, Manuel - In: European Journal of Operational Research 237 (2014) 3, pp. 802-813

The Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) belongs to the class of Inventory Routing Problems (IRP) in which the supplier optimises both the distribution costs and the inventory costs at the customers. The goal of the SV-CIRP is to minimise both kinds of costs and to maximise...

Persistent link: https://www.econbiz.de/10010776929

An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices

Hà, Minh Hoàng; Bostel, Nathalie; Langevin, André; … - In: European Journal of Operational Research 226 (2013) 2, pp. 211-220

relaxed. The problem is solved by a branch-and-cut algorithm and a metaheuristic. To develop the branch-and-cut algorithm, we … use a new integer programming formulation based on a two-commodity flow model. The metaheuristic is based on the …

Persistent link: https://www.econbiz.de/10011052480

A metaheuristic for the school bus routing problem with bus stop selection

Schittekat, Patrick; Kinable, Joris; Sörensen, Kenneth; … - In: European Journal of Operational Research 229 (2013) 2, pp. 518-528

Existing literature on routing of school buses has focused mainly on building intricate models that attempt to capture as many real-life constraints and objectives as possible. In contrast, the focus of this paper is on understanding the joint problem of bus route generation and bus stop...

Persistent link: https://www.econbiz.de/10011052507

Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

Cheang, Brenda; Gao, Xiang; Lim, Andrew; Qin, Hu; Zhu, … - In: European Journal of Operational Research 223 (2012) 1, pp. 60-75

We extend the traveling salesman problem with pickup and delivery and LIFO loading (TSPPDL) by considering two additional factors, namely the use of multiple vehicles and a limitation on the total distance that a vehicle can travel; both of these factors occur commonly in practice. We call the...

Persistent link: https://www.econbiz.de/10010597660

Single PON network design with unconstrained splitting stages

Gouveia, Luís; Lopes, Maria João; de Sousa, Amaro - In: European Journal of Operational Research 240 (2015) 2, pp. 361-371

A Passive Optical Network (PON) is a network technology for deploying access networks based on passive optical components. In a single PON access network, the client terminals are connected to a Central Office through optical splitters and interconnecting fibers where each splitter splits in...

Persistent link: https://www.econbiz.de/10011097793

Network construction problems with due dates

Averbakh, Igor; Pereira, Jordi - In: European Journal of Operational Research 244 (2015) 3, pp. 715-729

A network needs to be constructed by a server (construction crew) that has a constant construction speed which is incomparably slower than the server’s travel speed within the already constructed part of the network. A vertex is recovered when it becomes connected to the depot by an already...

Persistent link: https://www.econbiz.de/10011264292

Incremental network design with maximum flows

Kalinowski, Thomas; Matsypura, Dmytro; Savelsbergh, … - In: European Journal of Operational Research 242 (2015) 1, pp. 51-62

We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed...

Persistent link: https://www.econbiz.de/10011117493