Search Results - "Taillard, É D"

  • Showing 1 - 11 results of 11
Refine Results
  1. 1

    Ant colonies for the quadratic assignment problem by Gambardella, L M, Taillard, É D, Dorigo, M

    “…This paper presents HAS-QAP, a hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromone trail…”
    Get full text
    Journal Article
  2. 2

    POPMUSIC for a real-world large-scale vehicle routing problem with time windows by Ostertag, A, Doerner, K F, Hartl, R F, Taillard, E D, Waelti, P

    “…This paper presents a heuristic approach based on the POPMUSIC framework for a large-scale Multi Depot Vehicle Routing Problem with Time Windows derived from…”
    Get full text
    Journal Article
  3. 3
  4. 4

    Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem by Brimberg, Jack, Hansen, Pierre, Mladenović, Nenad, Taillard, Eric D.

    Published in Operations research (01-05-2000)
    “…The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the…”
    Get full text
    Journal Article
  5. 5

    A tabu search heuristic for the heterogeneous fleet vehicle routing problem by Gendreau, Michel, Laporte, Gilbert, Musaraganyi, Christophe, Taillard, Éric D.

    Published in Computers & operations research (01-10-1999)
    “…The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical Vehicle Routing Problem in which customers are served by a heterogeneous…”
    Get full text
    Journal Article
  6. 6

    Vehicle Routeing with Multiple Use of Vehicles by Taillard, Éric D., Laporte, Gilbert, Gendreau, Michel

    “…The vehicle routeing problem with multiple use of vehicles is a variant of the standard vehicle routeing problem in which the same vehicle may be assigned to…”
    Get full text
    Journal Article
  7. 7

    An adaptive memory heuristic for a class of vehicle routing problems with minmax objective by Golden, Bruce L., Laporte, Gilbert, Taillard, Éric D.

    Published in Computers & operations research (01-05-1997)
    “…We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with…”
    Get full text
    Journal Article
  8. 8

    POPMUSIC for the point feature label placement problem by Alvim, Adriana C.F., Taillard, Éric D.

    Published in European journal of operational research (01-01-2009)
    “…Point feature label placement is the problem of placing text labels adjacent to point features on a map so as to maximize legibility. The goal is to choose…”
    Get full text
    Journal Article
  9. 9

    Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods by Drezner, Zvi, Hahn, Peter M., Taillard, Éeric D.

    Published in Annals of operations research (01-10-2005)
    “…This paper reports heuristic and exact solution advances for the Quadratic Assignment Problem (QAP). QAP instances most often discussed in the literature are…”
    Get full text
    Journal Article
  10. 10

    Adaptive memory programming: A unified view of metaheuristics by Taillard, Éric D, Gambardella, Luca M, Gendreau, Michel, Potvin, Jean-Yves

    Published in European Journal of Operational Research (16-11-2001)
    “…The paper analyses recent developments of a number of memory-based metaheuristics such as taboo search (TS), scatter search (SS), genetic algorithms (GA) and…”
    Get full text
    Book Review Journal Article
  11. 11

    Heuristic Methods for Large Centroid Clustering Problems by Taillard, Eric D

    Published in Journal of heuristics (01-01-2003)
    “…This article presents new heuristic methods for solving a class of hard centroid clustering problems including the p-median, the sum-of-squares clustering and…”
    Get full text
    Journal Article