The vehicle routing problem

An optimization model for green supply chain management by using a big data analytic approach

Envisioning the invisible: Understanding the synergy between green human resource management and green supply chain management in manufacturing firms in Iran in light of the moderating effect of employees' resistance to change

A fuzzy multi-objective optimization model for sustainable reverse logistics network design

A Taxonomic Review of Metaheuristic Algorithms for Solving the Vehicle Routing Problem and Its Variants

For remanufacturing or recycling companies, a reverse supply chain is of prime importance since it facilitates in recovering parts and materials from end-of-life products. In reverse supply chains, selective separation of desired parts and materials from returned products is achieved by means of disassembly which is a process of systematic separation of an assembly into its components, subassemblies or other groupings. Due to its high productivity and suitability for automation, disassembly line is the most efficient layout for product recovery operations. A disassembly line must be balanced to optimize the use of resources (viz., labor, money and time). In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that requires the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures considering sequence dependent time increments. A hybrid algorithm that combines a genetic algorithm with a variable neighborhood search method (VNSGA) is proposed to solve the SDDLBP. The performance of VNSGA was thoroughly investigated using numerous data instances that have been gathered and adapted from the disassembly and the assembly line balancing literature. Using the data instances, the performance of VNSGA was compared with the best known metaheuristic methods reported in the literature. The tests demonstrated the superiority of the proposed method among all the methods considered.

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit

An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II

A model proposal for green supply chain network design based on consumer segmentation

The assembly line worker assignment and balancing problem type-II (ALWABP-2) occurs when workers and tasks (where task times depend on workers’ skills) are to be simultaneously assigned to a fixed number of workstations with the goal of minimising the cycle time. In this study, a two-phase variable neighbourhood search (VNS) algorithm is proposed to solve the ALWABP-2 due to the NP-hard nature of this problem. In the first phase of the algorithm, a VNS approach is applied to assign tasks to workstations with the aim of minimising the cycle time while in the second phase, a variable neighbourhood descent method is applied to assign workers to workstations. The performance of the proposed algorithm is tested on well-known benchmark instances. In addition, the proposed algorithm has been used to solve a real case study from a consumer electronics company that manufactures LCD TVs. The results show that the algorithm is superior to the methods reported in the literature in terms of its higher efficiency and r...

A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study

Olcay Polat

Papers

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem

A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit

An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II

A model proposal for green supply chain network design based on consumer segmentation

A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study