A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework

DOI10.1080/02522667.2011.10700129zbMath1244.90036OpenAlexW2321689004MaRDI QIDQ5891691

Yi-Hsiang Liao, Min-Chun Yu, Wei-Min Jeng

Publication date: 8 August 2012

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1269506H_13_JIOS_T097_32-6_pp1425-1442a.pdf

zbMATH Keywords

vehicle routingreverse logisticstime windowvertex coloring algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Scatter search for the vehicle routing problem with time windows
• The Truck Dispatching Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
• Adaptive memory programming: a unified view of metaheuristics
• Unnamed Item