Sciweavers

1940 search results - page 32 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
ICNC
2005
Springer
15 years 11 months ago
Harmony Search for Generalized Orienteering Problem: Best Touring in China
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
Zong Woo Geem, Chung-Li Tseng, Yongjin Park
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 10 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl
AIPS
2010
15 years 8 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
16 years 22 days ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
EOR
2007
163views more  EOR 2007»
15 years 6 months ago
The multi-depot vehicle routing problem with inter-depot routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
Benoit Crevier, Jean-François Cordeau, Gilb...