Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.1016/j.ejor.2009.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059317120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Convex Cost Integer Dual Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object modeling and path computation for multimodal travel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics from Nature for Hard Combinatorial Optimization Problems / 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 (DARP): variants, modeling issues and algorithms / 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: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label correcting methods to solve multicriteria shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / 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: Q4821303 / 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: A dial-a-ride problem for client transportation in a health-care organization / 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: Drive: Dynamic Routing of Independent Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / 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: A label correcting approach for solving bicriterion shortest-path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350083 / 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: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints / rank
 
Normal rank

Latest revision as of 09:48, 2 July 2024

scientific article
Language Label Description Also known as
English
Vehicle routing problems with alternative paths: an application to on-demand transportation
scientific article

    Statements

    Vehicle routing problems with alternative paths: an application to on-demand transportation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    vehicle routing
    0 references
    multigraph
    0 references
    shortest path problem with resource constraints
    0 references
    dynamic programming
    0 references
    on-demand transportation
    0 references
    dial-a-ride problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references