Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
From MaRDI portal
Publication:6113315
DOI10.1016/j.ejor.2023.02.028OpenAlexW4321483306MaRDI QIDQ6113315
Baldacci Roberto, Wei Sun, Jianwen Zhou, Yi-Ming Liu, Yang Yu, Yu Zhang
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.02.028
Cites Work
- Unnamed Item
- A review of recent research on green road freight transportation
- The vehicle-routing problem with time windows and driver-specific times
- Vehicle routing to minimize time-dependent emissions in urban areas
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- A branch-and-price approach for a multi-period vehicle routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- The school bus routing problem: a review
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
- The robust vehicle routing problem with time windows: solution by branch and price and cut
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
- A metaheuristic for the time-dependent pollution-routing problem
- Vehicle dispatching with time-dependent travel times
- A way to optimally solve a green time-dependent vehicle routing problem with time windows
- Perspectives on integer programming for time-dependent models
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- Tabu search for the time-dependent vehicle routing problem with time windows on a road network
- Multi-trip time-dependent vehicle routing problem with time windows
- Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels
- A generic exact solver for vehicle routing and related problems
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The bi-objective pollution-routing problem
- Time dependent vehicle routing problem with a multi ant colony system
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- A unified solution framework for multi-attribute vehicle routing problems
- Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance
- A survey of adaptive large neighborhood search algorithms and applications
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- Robust Data-Driven Vehicle Routing with Time Windows
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- Handbook of metaheuristics
This page was built for publication: Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows
