Comparing different metaheuristic approaches for the median path problem with bounded length

DOI10.1016/j.ejor.2007.07.001zbMath1146.90456OpenAlexW2065039163MaRDI QIDQ928015

Andrea Scozzari, Isabella Lari, Federica Ricca

Publication date: 11 June 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.07.001

zbMATH Keywords

tabu searchlocationmedian path problemold bachelor acceptance

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (9)

Rapid transit network design for optimal cost and origin-destination demand capture ⋮ Extensive facility location problems on networks: an updated review ⋮ Rejoinder on: ``Extensive facility location problems on networks: an updated review ⋮ Two Paths Location of a Tree with Positive or Negative Weights ⋮ Two paths location of a tree with positive or negative weights ⋮ Theory and application of reciprocal transformation of “path problem” and “time float problem” ⋮ Locating median paths on connected outerplanar graphs ⋮ The location of median paths on grid graphs ⋮ Reliability problems in multiple path-shaped facility location on networks

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Algorithms for central-median paths with bounded length on trees
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A review of extensive facility location in networks
• A multi-modal approach to the location of a rapid transit line
• The median tour and maximal covering tour problems: Formulations and heuristics
• Finding the \(\ell\)-core of a tree
• Variable neighborhood tabu search and its application to the median cycle problem.
• The centdian subtree on tree networks
• Metaheuristics: A bibliography
• The location of median paths on grid graphs
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• On locating path- or tree-shaped facilities on networks
• Optimal location of a path or tree on a network with cycles
• The optimal location of a path or tree in a tree network
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• On Locating a Facility to Service Areas within a Network
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• The continuous and discrete path‐variance problems on trees
• Conditional location of path and tree shaped facilities on trees
• The bi‐criteria doubly weighted center‐median path problem on a tree
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices

This page was built for publication: Comparing different metaheuristic approaches for the median path problem with bounded length