A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Richard F. Hartl / rank
Normal rank
 
Property / author
 
Property / author: Richard F. Hartl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPEA2 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20335 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4232385207 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59389687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with Path Relinking for Three-Index Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-a-ride problem: Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A population-based algorithm for solving linear assignment problems with two objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Dial-a-Ride problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-objective covering tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for a bi-objective capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for a multi-objective routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two phase algorithms for the bi-objective assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP with path-relinking for private virtual circuit routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:58, 3 July 2024

scientific article
Language Label Description Also known as
English
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
scientific article

    Statements

    A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    variable neighborhood search
    0 references
    path relinking
    0 references
    bi-objective optimization
    0 references
    0 references

    Identifiers