Similar Search Results

Sequential and parallel large neighborhood search algorithms for the periodic location routing problem

Hemmelmayr, Vera C. - In: European Journal of Operational Research 243 (2015) 1, pp. 52-60

We propose a large neighborhood search (LNS) algorithm to solve the periodic location routing problem (PLRP). The PLRP … combines location and routing decisions over a planning horizon in which customers require visits according to a given …

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

Ranking paths in stochastic time-dependent networks

Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, … - In: European Journal of Operational Research 236 (2014) 3, pp. 903-914

In this paper we address optimal routing problems in networks where travel times are both stochastic and time …

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

An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem

Aksen, Deniz; Kaya, Onur; Sibel Salman, F.; Tüncel, Özge - In: European Journal of Operational Research 239 (2014) 2, pp. 413-426

We study a selective and periodic inventory routing problem (SPIRP) and develop an Adaptive Large Neighborhood Search … present source nodes to include in the collection program, and which periodic (weekly) routing schedule to repeat over an …

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

Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach

Taş, D.; Gendreau, M.; Dellaert, N.; van Woensel, T.; … - In: European Journal of Operational Research 236 (2014) 3, pp. 789-799

We study a vehicle routing problem with soft time windows and stochastic travel times. In this problem, we consider …

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

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

Lysgaard, Jens; Wøhlk, Sanne - In: European Journal of Operational Research 236 (2014) 3, pp. 800-810

In this paper we consider the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well …-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time …

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

Selective vehicle routing for a mobile blood donation system

Şahinyazan, Feyza Güliz; Kara, Bahar Y.; Taner, … - In: European Journal of Operational Research 245 (2015) 1, pp. 22-34

In this study, a mobile blood collection system is designed with the primary objective of increasing blood collection levels. This design also takes into account operational costs to aim for collection of large amounts of blood at reasonable cost. Bloodmobiles perform direct tours to certain...

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

Using discrete event simulation cellular automata models to determine multi-mode travel times and routes of terrestrial suppression resources to wildland fires

Duff, Thomas J.; Chong, Derek M.; Tolhurst, Kevin G. - In: European Journal of Operational Research 241 (2015) 3, pp. 763-770

Forest fires can impose substantial social, environmental and economic burdens on the communities on which they impact. Well managed and timely fire suppression can demonstrably reduce the area burnt and minimise consequent losses. In order to effectively coordinate emergency vehicles for fire...

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

Constraint programming for LNG ship scheduling and inventory management

Goel, V.; Slusky, M.; van Hoeve, W.-J.; Furman, K.C.; … - In: European Journal of Operational Research 241 (2015) 3, pp. 662-673

We propose a constraint programming approach for the optimization of inventory routing in the liquefied natural gas …

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

City streets parking enforcement inspection decisions: The Chinese postman’s perspective

Summerfield, Nichalin S.; Dror, Moshe; Cohen, Morris A. - In: European Journal of Operational Research 242 (2015) 1, pp. 149-160

We view an administrative activity of issuing parking tickets in a dense city street setting, like downtown Philadelphia or NYC, as a revenue collection activity. The task of designing parking permit inspection routes is modeled as a revenue collecting Chinese Postman Problem. After...

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

The mixed capacitated arc routing problem with non-overlapping routes

Constantino, Miguel; Gouveia, Luís; Mourão, Maria Cândida - In: European Journal of Operational Research 244 (2015) 2, pp. 445-456

Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with … additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle … overlapping MCARP (BCARP), which is defined as the mixed capacitated arc routing problem (MCARP) with an additional constraint …

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