The Truck Dispatching Problem
From MaRDI portal
Publication:2768987
DOI10.1287/mnsc.6.1.80zbMath0995.90560OpenAlexW2111563176WikidataQ29397701 ScholiaQ29397701MaRDI QIDQ2768987
J. H. Ramser, George B. Dantzig
Publication date: 22 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.6.1.80
Related Items (only showing first 100 items - show all)
Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ Learn global and optimize local: a data-driven methodology for last-mile routing ⋮ Approximating the chance-constrained capacitated vehicle routing problem with robust optimization ⋮ A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs ⋮ The split delivery vehicle routing problem with time windows and three-dimensional loading constraints ⋮ Simultaneous location and vehicle fleet sizing of relief goods distribution centers and vehicle routing for post-disaster logistics ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ Development of an algorithm for solving an asymmetric routing problem based on the ant colony method ⋮ A matheuristic for the MinMax capacitated open vehicle routing problem ⋮ A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles ⋮ Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems ⋮ A case study of consistent vehicle routing problem with time windows ⋮ Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks ⋮ Bi‐objective green vehicle routing problem ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ The in‐house logistics routing problem ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ Selective arc‐ng pricing for vehicle routing ⋮ Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge ⋮ Two-phase algorithm for solving vehicle routing problem with time windows ⋮ Cross-dock facility for disaster relief operations ⋮ Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem ⋮ A two-stage stochastic location-routing problem for electric vehicles fast charging ⋮ Real-time passenger bus routing problems with preferences and tradeoffs ⋮ The stochastic inventory routing problem on electric roads ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems ⋮ Application of Adapt-CMSA to the two-echelon electric vehicle routing problem with simultaneous pickup and deliveries ⋮ Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem ⋮ Learn and route: learning implicit preferences for vehicle routing ⋮ Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows ⋮ Introducing the Localized Genetic Algorithm for Small Scale Capacitated Vehicle Routing Problems ⋮ Bi-objective blood product scheduling under blood shortage and limited supply ⋮ Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles ⋮ Bi-objective overlapped links vehicle routing problem for risk minimizing valuables transportation ⋮ Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ A green routing-location problem in a cold chain logistics network design within the balanced score card pillars in fuzzy environment ⋮ Routing problems with electric and autonomous vehicles: review and potential for future research ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Solving vehicle routing problems with intermediate stops using VRPSolver models ⋮ Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem ⋮ A decentralized production–distribution scheduling problem: Solution and analysis ⋮ A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vehicle dispatching system based on Taguchi-tuned fuzzy rules ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Branch and cut methods for network optimization ⋮ Distribution of waiting time for dynamic pickup and delivery problems ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ Scheduling issues in vehicle routing ⋮ An improved formulation for the multi-depot open vehicle routing problem ⋮ A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service ⋮ Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows ⋮ Solving the petroleum replenishment and routing problem with variable demands and time windows ⋮ A branch-and-cut algorithm for vehicle routing problems ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers ⋮ A savings-based model for two-shipper cooperative routing ⋮ Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm ⋮ A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ Daily aircraft routing for amphibious ready groups ⋮ Stronger multi-commodity flow formulations of the capacitated vehicle routing problem ⋮ An ant colony system for responsive dynamic vehicle routing ⋮ Optimal routing for electric vehicle service systems ⋮ A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations ⋮ Thirty years of heterogeneous vehicle routing ⋮ On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows ⋮ An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints ⋮ Measures of dynamism and urgency in logistics ⋮ A multi-agent based cooperative approach to scheduling and routing ⋮ Approximability of the minimum-weight \(k\)-size cycle cover problem ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services ⋮ A two phase variable neighborhood search for the multi-product inventory routing problem ⋮ Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm ⋮ A branch-and-price approach for a multi-period vehicle routing problem ⋮ Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ Faster rollout search for the vehicle routing problem with stochastic demands and restocking ⋮ A fast two-level variable neighborhood search for the clustered vehicle routing problem ⋮ An open source spreadsheet solver for vehicle routing problems ⋮ The flexible periodic vehicle routing problem ⋮ Robust vehicle routing problem with hard time windows under demand and travel time uncertainty ⋮ The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization ⋮ Approximation schemes for Euclidean vehicle routing problems with time windows ⋮ Using clustering analysis in a capacitated location-routing problem ⋮ A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem ⋮ A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run ⋮ Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry ⋮ The vehicle routing problem with backhauls ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ A min-max vehicle routing problem with split delivery and heterogeneous demand ⋮ Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
This page was built for publication: The Truck Dispatching Problem