Sciweavers

599 search results - page 95 / 120
» The traveling salesman problem
Sort
View
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 2 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
AAAI
1997
13 years 9 months ago
The Scaling of Search Cost
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby...
ANOR
2007
151views more  ANOR 2007»
13 years 8 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels
TRANSCI
2008
122views more  TRANSCI 2008»
13 years 7 months ago
Scheduling Locomotives and Car Transfers in Freight Transport
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
Armin Fügenschuh, Henning Homfeld, Andreas Hu...
PVLDB
2010
146views more  PVLDB 2010»
13 years 6 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras