Combinatorial optimization and green logistics
From MaRDI portal
Publication:5900891
DOI10.1007/s10479-009-0651-zzbMath1185.90178OpenAlexW2051316737MaRDI QIDQ5900891
Abdelkader Sbihi, Richard W. Eglese
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0651-z
Related Items
Planning sustainable routes: economic, environmental and welfare concerns, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, Sustainable operations, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem, Influence of non-price and environmental sustainability factors on truckload procurement process, A tabu search algorithm to solve a green logistics bi-objective bi-level problem, Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint, The green location-routing problem, Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management, Green supply chain management, environmental degradation, and energy: evidence from Asian countries, A genetic algorithm for a green vehicle routing problem, Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks, The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem, The role of operational research in green freight transportation, A multiperiod supply chain network design considering carbon emissions, Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet, Effective location models for sorting recyclables in public management
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- VRP
- Recyclable waste collection planning -- a case study
- Competitive memetic algorithms for arc routing problems
- A deterministic tabu search algorithm for the capacitated arc routing problem
- 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
- Concurrent product and closed-loop supply chain design with an application to refrigerators
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- Combinatorial optimization and green logistics
- Quantitative models for reverse logistics