Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
From MaRDI portal
Publication:2658463
DOI10.1155/2020/9291434OpenAlexW3007678547MaRDI QIDQ2658463
Longlong Leng, Chunmiao Zhang, Jingling Zhang, Yanwei Zhao, Wan-Liang Wang
Publication date: 22 March 2021
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/9291434
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A review of hyper-heuristics for educational timetabling
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- A survey of recent research on location-routing problems
- Fast machine reassignment
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- Adaptive selection of heuristics for improving exam timetables
- The stop-and-drop problem in nonprofit food distribution networks
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Combined location-routing problems -- a neural network approach
- Local improvement in planar facility location using vehicle routing
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- Multiconstrained network intensive vehicle routing adaptive ant colony algorithm in the context of neural network analysis
- Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem
- Two echelon location routing problem with simultaneous pickup and delivery: mixed integer programming formulations and comparative analysis
- Modelling beneficiaries' choice in disaster relief logistics
- Monte Carlo hyper-heuristics for examination timetabling
- A computational comparison of flow formulations for the capacitated location-routing problem
- A location-routing problem in glass recycling
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- An Exact Method for the Capacitated Location-Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
