Displaying similar documents to “New bounds for oblivious mesh routing.”

Sensitivity examination of the simulation result of discrete event dynamic systems with perturbation analysis.

Tamas Koltai, Juan Carlos Larrañeta, Luis Onieva, Sebastián Lozano (1994)

Qüestiió

Similarity:

Simulation completed with perturbation analysis provides a new approach for the optimal control of queuing network type systems. The objective of this paper is to calculate the sensitivity range of finite zero-order perturbation, that is, to determine the maximum and minimum size of perturbation within which zero-order propagation rules can be applied. By the introduction of the concept of virtual queue and first and second level no-input and full-output matrices, an algorithm is provided...

A memetic algorithm for the vehicle routing problem with time windows

Nacima Labadi, Christian Prins, Mohamed Reghioui (2008)

RAIRO - Operations Research

Similarity:

This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a least-cost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is also able to minimize the total distance travelled. The results on 56 classical instances...

A threshold accepting approach to the open vehicle routing problem

Christos D. Tarantilis, George Ioannou, Chris T. Kiranoudis, Gregory P. Prastacos (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute...