Similar Search Results

Multi-period traffic routing in satellite networks

Gamvros, Ioannis; Raghavan, S. - In: European Journal of Operational Research 219 (2012) 3, pp. 738-750

We introduce a traffic routing problem over an extended planning horizon that appears in geosynchronous satellite … networks. Unlike terrestrial (e.g., fiber optic) networks, routing on a satellite network is not transparent to the customers … requires the network planners to explicitly consider these penalties in their routing decisions over multiple time periods and …

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

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

Luo, Zhixing; Qin, Hu; Lim, Andrew - In: European Journal of Operational Research 234 (2014) 1, pp. 49-60

In this paper, we extend the multiple traveling repairman problem by considering a limitation on the total distance that a vehicle can travel; the resulting problem is called the multiple traveling repairmen problem with distance constraints (MTRPD). In the MTRPD, a fleet of identical vehicles...

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

A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem

Wendolsky, Rolf; Scheuerer, Stephan - Wirtschaftswissenschaftliche Fakultät, Universität … - 2006

The Vehicle Routing Problem (VRP) is one of the most studied problems in the field of Operations Research. Closely … constructed to generate the routing information. In a previous study the Scatter Search methodology was used to solve the CCP … presents the necessary modifications to adopt this approach to the VRP. Das Tourenplanungs-Problem (Vehicle Routing Problem …

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

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

Branch-and-price and constraint programming for solving a real-life technician dispatching problem

Cortés, Cristián E.; Gendreau, Michel; Rousseau, … - In: European Journal of Operational Research 238 (2014) 1, pp. 300-312

We consider a real problem faced by a large company providing repair services of office machines in Santiago, Chile. In a typical day about twenty technicians visit seventy customers in a predefined service area in Santiago. We design optimal routes for technicians by considering travel times,...

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

Using branch-and-price approach to solve the directed network design problem with relays

Li, Xiangyong; Aneja, Y.P.; Huo, Jiazhen - In: Omega 40 (2012) 5, pp. 672-679

telecommunication system, where relay points are necessary. The DNDR problem consists of introducing a subset of arcs and locating … relays on a subset of nodes such that in the resulting network, the total cost (arc cost plus relay cost) is minimized, and … and the first relay, any two consecutive relays, and the last relay and the destination do not exceed a predefined …

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

Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design

Souza, Fernanda S.H.; Gendreau, Michel; Mateus, Geraldo R. - In: European Journal of Operational Research 233 (2014) 1, pp. 84-93

In this work, we investigate the Resilient Multi-level Hop-constrained Network Design (RMHND) problem, which consists of designing hierarchical telecommunication networks, assuring resilience against random failures and maximum delay guarantees in the communication. Three mathematical...

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

Benefits of in-vehicle consolidation in less than truckload freight transportation operations

Mesa-Arango, Rodrigo; Ukkusuri, Satish V. - In: Transportation Research Part E: Logistics and … 60 (2013) C, pp. 113-125

-and-delivery vehicle routing problem that is solved using a branch-and-price algorithm. The numerical experiment shows that non …

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

The bike sharing rebalancing problem: Mathematical formulations and benchmark instances

Dell'Amico, Mauro; Hadjicostantinou, Eleni; Iori, Manuel; … - In: Omega 45 (2014) C, pp. 7-19

Bike sharing systems offer a mobility service whereby public bicycles, located at different stations across an urban area, are available for shared use. These systems contribute towards obtaining a more sustainable mobility and decreasing traffic and pollution caused by car transportation. Since...

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

Vendor managed inventory in tramp shipping

Stålhane, Magnus; Andersson, Henrik; Christiansen, Marielle - In: Omega 47 (2014) C, pp. 60-72

describing the routing and scheduling problem faced by a tramp shipping company that offers a VMI service to its customers. The … routing and scheduling problem faced by tramp shipping companies using COA. The computational results show that it is possible …

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