A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
From MaRDI portal
Publication:6079856
DOI10.1111/itor.12991OpenAlexW3161347074MaRDI QIDQ6079856
Carlos Contreras-Bolton, Unnamed Author, Valentina Cacchiani, Paolo Toth
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12991
linear programming relaxationmatheuristic algorithmenergy minimization traveling salesman problempollution traveling salesman problem
Related Items
Matheuristics: survey and synthesis ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- A review of recent research on green road freight transportation
- A matheuristic approach for the pollution-routing problem
- A speed and departure time optimization algorithm for the pollution-routing problem
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- Multi-operator based evolutionary algorithms for solving constrained optimization problems
- A random-key genetic algorithm for the generalized traveling salesman problem
- Parameter setting in evolutionary algorithms.
- The ``molecular traveling salesman
- An efficient algorithm for the minimum capacity cut problem
- Tuning metaheuristics. A machine learning Perspective
- A path-based solution approach for the green vehicle routing problem
- 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
- The role of operational research in green freight transportation
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- A new memetic algorithm for the asymmetric traveling salesman problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Genetic algorithms for the traveling salesman problem
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Using cost change estimates in a local search heuristic for the pollution routing problem
- Routing vehicles to minimize fuel consumption
- Energy Minimizing Vehicle Routing Problem
- Randomized heuristics for the family traveling salesperson problem
- Traveling salesman problems with profits and stochastic customers
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem
- Introduction to evolutionary computing
- An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem
