A mathematical model to optimize transport cost and inventory level in a single level logistic network

• Apostolos Ampatzoglou, University of Macedonia (Greece) • Mathieu Acher, University of Rennes I, IRISA/INRIA (France) • Bartosz Walter, Poznań University of Technology (Poland)

In particular, we will show that for the relativistic cost functions (not necessarily highly relativistic, then) the first claims is still valid (even removing the

In this paper we have proposed a metaheuristic method, called Backtracking Adaptive Threshold Accepting (BATA) for solving the Open Vehicle Routing Prob- lem (OVRP).. The OVRP is

If the distance matrix C fulfills the Demidenko (Kalmanson, Supnick) conditions, it is called a Euclidean Demidenko (Kalmanson, Supnick) matrix the séquence P is called a

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

2014 We propose and analyse a replica symmetric solution for random link travelling salesman problems1. This gives reasonable analytical estimates for thermodynamic

cities are represented by random lattice sites, occupied with concentration p, and the salesman intends to visit a finite fraction f of the total number of

Hence the idea: If we saw servers or nodes of the graph as a node in an electrical circuit, and the "distances" between vertices as a resistor values in a circuit, then more