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

DOI10.1016/J.EJOR.2007.07.001MaRDI QIDQ928015zbMATH OpenOpenAlexFDO

Authors Isabella Lari, Federica Ricca, Andrea Scozzari

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

locationtabu searchmedian path problemold bachelor acceptance

Mathematics Subject Classification ID

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

Recommendations

• The \(p\)-median problem: a survey of metaheuristic approaches
• scientific article; zbMATH DE number 2090005
• An efficient tabu search procedure for the \(p\)-median problem
• Algorithms for central-median paths with bounded length on trees
• Finding the conditional location of a median path on a tree

Cites work

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

Cited in

(9)

• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• 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
• Rapid transit network design for optimal cost and origin-destination demand capture
• Locating median paths on connected outerplanar graphs
• Reliability problems in multiple path-shaped facility location on networks
• The location of median paths on grid graphs
• Two paths location of a tree with positive or negative weights

Describes a project that uses

Uses Software

• TSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q928015)