Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129925056, #quickstatements; #temporary_batch_1724809781087
 
(5 intermediate revisions by 5 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.cor.2018.04.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2801120890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut algorithms for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problems with split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bike sharing systems: solving the static rebalancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for a single vehicle static bike sharing rebalancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A destroy and repair algorithm for the bike sharing rebalancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the static rebalancing problem arising in bicycle sharing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The static bicycle relocation problem with demand intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load-dependent and precedence-based models for pickup and delivery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery / 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: Models for the single-vehicle preemptive pickup and delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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: The travelling salesman problem with pick-up and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graphical relaxation: A new framework for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129925056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:55, 28 August 2024

scientific article
Language Label Description Also known as
English
Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
scientific article

    Statements

    Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (English)
    0 references
    11 July 2018
    0 references
    travelling salesman
    0 references
    vehicle routing problem
    0 references
    split demand
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers