Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738): Difference between revisions

From MaRDI portal
Changed an 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: Genocop / 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.2013.12.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025796617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact model and tight bounds for a combined location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution network design: New problems and related models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using clustering analysis in a capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restructuring of Swiss parcel delivery services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of flow formulations for the capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the two-echelon capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP\(\times \)ELS approach for the capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase hybrid heuristic algorithm for the capacitated location-routing problem / 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: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of heuristics for a two-level routing-location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for location routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing solid waste collection in Brussels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hub location problem in designing digital data service networks: Lagrangian relaxation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many-to-many location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective evolutionary algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid evolutionary algorithm for the periodic location-routing problem / 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: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase tabu search approach to the location routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions to multi-depot location-routing problems / rank
 
Normal rank

Latest revision as of 16:09, 9 July 2024

scientific article
Language Label Description Also known as
English
Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
scientific article

    Statements

    Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (English)
    0 references
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    location-routing
    0 references
    inter-hub transport
    0 references
    multi-commodity pickup-and-delivery
    0 references
    mixed-integer linear programming
    0 references
    fix-and-optimize
    0 references
    genetic algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references