Similar Search Results

A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems

Jin, Jianyong; Crainic, Teodor Gabriel; Løkketangen, Arne - In: European Journal of Operational Research 222 (2012) 3, pp. 441-451

solving the capacitated vehicle routing problem. Single neighborhood or neighborhood combinations are encapsulated in tabu …

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

The line planning routing game

Gattermann, Gattermann, P.; Schiewe, Schiewe, A.; … - Erasmus Research Institute of Management (ERIM), … - 2014

travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we …

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

The formation of the Japanese railway network in the 1890s: the case of the Kobu line

Sato, Masahiro - London School of Economics (LSE) - 1990

Preface: Professor Masahiro Satō of the Institute of Economic Research, Hitotsubashi University, presented this paper at a special session of the joint LSE-SOAS seminar series 'Japanese Economy and Society in Comparative Historical Perspective, held on 14 March 1990 at STICERD. The seminar...

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

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

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

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

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

Infrastructure Network Design with a Multi-Model Approach: Comparing Geometric Graph Theory with an Agent-Based Implementation of an Ant Colony Optimization

Heijnen, Petra; Chappin, Emile; Nikolic, Igor - In: Journal of Artificial Societies and Social Simulation 17 (2014) 4, pp. 1-1

infrastructures or their complete new development. Traditionally, infrastructure planning and routing issues are solved through top … routing algorithms to connect a single source node to multiple consuming nodes in a topology with hard boundaries and no … Optimization algorithm implemented as an Agent Based Model. Experimenting with 100 randomly generated routing problems, we find …

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

High-performance distribution of limited resources via a dynamical reallocation scheme

Lee, K.H.; Hui, P.M. - In: Physica A: Statistical Mechanics and its Applications 387 (2008) 26, pp. 6657-6662

Using the context of routing efficiency in a complex scale-free network, we study the problem of how a limited amount …

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