Combinatorial optimization and green logistics
From MaRDI portal
Publication:5925286
DOI10.1007/s10288-007-0047-3zbMath1149.90105OpenAlexW1976043550MaRDI QIDQ5925286
Abdelkader Sbihi, Richard W. Eglese
Publication date: 31 August 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-007-0047-3
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (20)
Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption ⋮ A review of recent research on green road freight transportation ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ Twelve surveys in operations research ⋮ Scheduling policies for multi-period services ⋮ The hybrid electric vehicle-traveling salesman problem ⋮ Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator ⋮ Including sustainability criteria into inventory models ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows ⋮ A meta-heuristic for capacitated green vehicle routing problem ⋮ Surveys in operations research ⋮ Application of data envelopment analysis models in supply chain management: a systematic review and meta-analysis ⋮ Sustainable supply chain management: a modeling perspective ⋮ A way to optimally solve a green time-dependent vehicle routing problem with time windows ⋮ Combinatorial optimization and green logistics ⋮ Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study ⋮ Quantitative models for sustainable supply chain management: developments and directions ⋮ A stochastic dynamic programming based model for uncertain production planning of re-manufacturing system ⋮ Modeling reverse logistics process in the agro-industrial sector: the case of the palm oil supply chain
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recyclable waste collection planning -- a case study
- Competitive memetic algorithms for arc routing problems
- The fleet size and mix problem for capacitated arc routing
- Environmental integrated production and recycling management
- Quantitative models for reverse logistics: A review
- A multiobjective programming model for locating treatment sites and routing hazardous wastes
- The return plant location problem: Modelling and resolution
- A two-level network for recycling sand: A case study
- Business case Océ: Reverse logistic network re-design for copiers
- A linear programming model for the separate refuse collection service.
- Evolutionary algorithms for periodic arc routing problems
- A dynamic vehicle routing problem with time-dependent travel times
- Transforming arc routing into node routing problems
- A guided local search heuristic for the capacitated arc routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Time dependent vehicle routing problem with a multi ant colony system
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- A constraint programming approach to the Chinese postman problem with time windows
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
- A scatter search for the periodic capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- The Truck Dispatching Problem
- The Rollon–Rolloff Vehicle Routing Problem
- A closed-loop logistics model for remanufacturing
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Dynamic lot sizing with product returns and remanufacturing
- Capacitated arc routing problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Capacitated Arc Routing Problem: Lower bounds
- Optimal sequencing of skip collections and deliveries
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Vehicle routing in the 1-skip collection problem
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- Quantitative models for reverse logistics
This page was built for publication: Combinatorial optimization and green logistics
