Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Adaptive memory programming: a unified view of metaheuristics

Article Abstract:

Recent development in memory-based metaheuristics, including genetic algorithms, taboo search, scatter search and ant colonies, are discussed.

Author: Taillard, Eric D., Gambardella, Luca M., Gendreau, Michel, Potvin, Jean-Yves
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
Operations research, Management science, Problem solving

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


An exact algorithm for a single-vehicle routing problem with time windows and multiple routes

Article Abstract:

An method based on an elementary shortest path algorithm is developed to solve the a problem where the same vehicle performs several routes to serve a set of customers with time windows. The method can be used o solve home delivery vehicle routes.

Author: Gendreau, Michel, Potvin, Jean-Yves, Azi, Nabila
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2007
United States, Management dynamics, Models, Management, Usage, Company business management, High speed ground transportation, Ground transportation, Mathematical optimization

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


On the flexibility of constraint programming models: from single to multiple time windows for the traveling salesman problem

Article Abstract:

Constraints can be removed or added to constraint programming models without any risk of destroying a certain problem structure on which the solution strategy depends. Such property enhances the resolution of variations in a traveling salesman problem by allowing easy adaptation of a constraint programming (CP) algorithm. Study shows that CP's growing impact in combinatorial optimization can be attributed to its flexible modeling capabilities.

Author: Gendreau, Michel, Potvin, Jean-Yves, Pesant, Gilles, Rousseau, Jean-Marc
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Operations Research, Analysis, Branch and bound algorithms, Traveling-salesman problem, Mathematical programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Optimization theory
Similar abstracts:
  • Abstracts: Stochastically minimizing total flowtime in flowshops with no waiting space. Minimizing maximum lateness with job families
  • Abstracts: Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. Warehouse design and control: framework and literature review
  • Abstracts: A tabu search method guided by shifting bottleneck for the job shop scheduling problem. A combined cutting-stock and lot-sizing problem
  • Abstracts: Only the best 'enfant cuisine' for the British bib-wearing set. Top 'pester' publishing booms
  • Abstracts: Sulzer unveils major restructuring plan as bourse delves into insider trading. Sulzer Ltd. chairman steps down, citing hostile takeover bid
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.