A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (Q1652016): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jørgen Glomvik Rakke / rank
Normal rank
 
Property / author
 
Property / author: Jørgen Glomvik Rakke / 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.2016.07.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2486387210 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59166715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections / 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: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / 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: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / 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: Heuristics for the traveling salesman problem with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-Many-to-One Single Vehicle Pickup and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / 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 traveling salesman problem with draft limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the pickup and delivery traveling salesman problem / 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: Survey Paper—Time Window Constrained Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maritime inventory routing problem: practical approach / rank
 
Normal rank

Latest revision as of 03:05, 16 July 2024

scientific article
Language Label Description Also known as
English
A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
scientific article

    Statements

    A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maritime transportation
    0 references
    traveling salesman problem with pickup and delivery
    0 references
    draft limit
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references