Showing 1 - 10 of 605
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
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
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
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
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
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
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
-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
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
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