Sciweavers

303 search results - page 32 / 61
» Traveling Salesman Problem with Transportation
Sort
View
HEURISTICS
2007
103views more  HEURISTICS 2007»
15 years 6 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
SSD
2005
Springer
145views Database» more  SSD 2005»
15 years 11 months ago
High Performance Multimodal Networks
Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in tra...
Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
COMGEO
2008
ACM
15 years 6 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...
EOR
2008
97views more  EOR 2008»
15 years 6 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
AIR
2010
96views more  AIR 2010»
15 years 6 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták