Skewed general variable neighborhood search for the location routing scheduling problem
From MaRDI portal
Publication:337608
DOI10.1016/j.cor.2015.03.011zbMath1348.90406OpenAlexW2060759046MaRDI QIDQ337608
Saïd Hanafi, Bruna Ramos, Cláudio Alves, Rita Macedo, Nenad Mladenović, Bassem Jarboui, José M. Valério de Carvalho
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.03.011
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (8)
The latency location-routing problem ⋮ The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals ⋮ Variable neighborhood search for optimizing the transportation of agricultural raw materials ⋮ Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture ⋮ Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls ⋮ Location‐routing problem: a classification of recent research ⋮ Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation
Cites Work
- Unnamed Item
- Variable neighborhood search for location routing
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- A survey of dual-feasible and superadditive functions
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- A time-indexed LP-based approach for min-sum job-shop problems
- Adaptive memory programming for the vehicle routing problem with multiple trips
- Location-routing: issues, models and methods
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- Using clustering analysis in a capacitated location-routing problem
- A GA based heuristic for the vehicle routing problem with multiple trips
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Variable neighbourhood search: Methods and applications
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Combined location-routing problems: A synthesis and future research directions
- Variable neighborhood search
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- LP models for bin packing and cutting stock problems
- A compact model and tight bounds for a combined location-routing problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Vehicle Routeing with Multiple Use of Vehicles
- Nested Heuristic Methods for the Location-Routeing Problem
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- Variable neighborhood search: Principles and applications
This page was built for publication: Skewed general variable neighborhood search for the location routing scheduling problem
