scientific article; zbMATH DE number 1452992

From MaRDI portal
Publication:4955264

zbMath0966.90009MaRDI QIDQ4955264

Paolo Toth, Daniele Vigo

Publication date: 25 May 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

A simple and effective evolutionary algorithm for the vehicle routing problem, An optimization approach for communal home meal delivery service: A case study, Modelling the mobile target covering problem using flying drones, Comparison of anticipatory algorithms for a dial-a-ride problem, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Truck routing and scheduling, Dynamic vehicle routing using genetic algorithms, Approximability of the minimum-weight \(k\)-size cycle cover problem, A heuristic algorithm for a supply chain's production-distribution planning, Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem, An approximation algorithm for the pickup and delivery vehicle routing problem on trees, Approximation schemes for Euclidean vehicle routing problems with time windows, Deep infeasibility exploration method for vehicle routing problems, The school bus problem on trees, What you should know about the vehicle routing problem, Finished-vehicle transporter routing problem solved by loading pattern discovery, An exponential (matching based) neighborhood for the vehicle routing problem, The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands, Optimization problems with flexible objectives: a general modeling approach and applications, The selective traveling salesman problem with emission allocation rules, Selfish Transportation Games, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Synchronized routing of seasonal products through a production/distribution network, Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees, Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility, A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing, The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints, The school bus routing and scheduling problem with transfers, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods, The complexity landscape of decompositional parameters for ILP, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, Selective and periodic inventory routing problem for waste vegetable oil collection, A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Sequential search and its application to vehicle-routing problems, A lower bound for the adaptive two-echelon capacitated vehicle routing problem, Combinatorial optimization and green logistics, Solving the vehicle routing problem with adaptive memory programming methodology, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem, Linear formulations for the vehicle routing problem with synchronization constraints, Dynamic programming based metaheuristics for the dial-a-ride problem, Flow-based integer linear programs to solve the weekly log-truck scheduling problem, Reoptimization framework and policy analysis for maritime inventory routing under uncertainty, A New Model Approach on Cost-Optimal Charging Infrastructure for Electric-Drive Vehicle Fleets, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Heuristic solutions to multi-depot location-routing problems


Uses Software