Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2530927020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows / 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: Q3588651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the Stacker Crane Problem on trees which is almost surely exact / 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 Primer in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The attractive traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single vehicle routing problem with deliveries and selective pickups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-commodity pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient column-generation-based algorithm for solving a pickup-and-delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows / rank
 
Normal rank

Latest revision as of 16:49, 15 July 2024

scientific article
Language Label Description Also known as
English
Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
scientific article

    Statements

    Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    decision support systems
    0 references
    transportation
    0 references
    logistics
    0 references
    branch and bound
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references