Sciweavers

4430 search results - page 203 / 886
» Solving Optimization Problems with DLL
Sort
View
130
Voted
MP
2010
145views more  MP 2010»
15 years 2 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
144
Voted
COR
2007
163views more  COR 2007»
15 years 3 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
15 years 10 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
120
Voted
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
15 years 9 months ago
Concept-based multi-objective problems and their solution by EC
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...
Amiram Moshaiov, Gideon Avigad
99
Voted
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 9 months ago
Genetic algorithms for the sailor assignment problem
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
Deon Garrett, Joseph Vannucci, Rodrigo Silva, Dipa...