The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
From MaRDI portal
Publication:5136080
DOI10.1287/ijoc.2017.0800zbMath1448.90019OpenAlexW2894610790MaRDI QIDQ5136080
Joe Naoum-Sawaya, Bissan Ghaddar, Claudio Gambella
Publication date: 25 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2017.0800
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (4)
The pickup and delivery problem with alternative locations and overlapping time windows ⋮ Unsupervised Learning for Human Mobility Behaviors ⋮ A customized genetic algorithm for bi-objective routing in a dynamic network ⋮ Robust drone selective routing in humanitarian transportation network assessment
Uses Software
Cites Work
- The exact solution of several classes of inventory-routing problems
- On vehicle placement to intercept moving targets
- About Lagrangian methods in integer optimization
- How to collect balls moving in the Euclidean plane
- The multiple traveling salesmen problem with moving targets
- The traveling salesman problem: An overview of exact and approximate algorithms
- Approximation results for kinetic variants of TSP
- The traveling salesman problem and its variations
- Solving the aerial fleet refueling problem using group theoretic tabu search
- The Truck Dispatching Problem
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- Vehicle Routing
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Column Generation Approach for Graph Coloring
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- The moving-target traveling salesman problem
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies
- Real-Time Ride-Sharing Substitution Service in Multi-modal Public Transport Using Buckets
- Carpooling : the 2 Synchronization Points Shortest Paths Problem
This page was built for publication: The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
