603 research outputs found
Capacitated Vehicle Routing with Non-Uniform Speeds
The capacitated vehicle routing problem (CVRP) involves distributing
(identical) items from a depot to a set of demand locations, using a single
capacitated vehicle. We study a generalization of this problem to the setting
of multiple vehicles having non-uniform speeds (that we call Heterogenous
CVRP), and present a constant-factor approximation algorithm.
The technical heart of our result lies in achieving a constant approximation
to the following TSP variant (called Heterogenous TSP). Given a metric denoting
distances between vertices, a depot r containing k vehicles with possibly
different speeds, the goal is to find a tour for each vehicle (starting and
ending at r), so that every vertex is covered in some tour and the maximum
completion time is minimized. This problem is precisely Heterogenous CVRP when
vehicles are uncapacitated.
The presence of non-uniform speeds introduces difficulties for employing
standard tour-splitting techniques. In order to get a better understanding of
this technique in our context, we appeal to ideas from the 2-approximation for
scheduling in parallel machine of Lenstra et al.. This motivates the
introduction of a new approximate MST construction called Level-Prim, which is
related to Light Approximate Shortest-path Trees. The last component of our
algorithm involves partitioning the Level-Prim tree and matching the resulting
parts to vehicles. This decomposition is more subtle than usual since now we
need to enforce correlation between the size of the parts and their distances
to the depot
Bütünleşik tedarik zinciri çizelgeleme modelleri: Bir literatür taraması
Research on integration of supply chain and scheduling is relatively recent, and
number of studies on this topic is increasing. This study provides a comprehensive
literature survey about Integrated Supply Chain Scheduling (ISCS) models to help
identify deficiencies in this area. For this purpose, it is thought that this study will
contribute in terms of guiding researchers working in this field. In this study,
existing literature on ISCS problems are reviewed and summarized by introducing
the new classification scheme. The studies were categorized by considering the
features such as the number of customers (single or multiple), product lifespan
(limited or unlimited), order sizes (equal or general), vehicle characteristics
(limited/sufficient and homogeneous/heterogeneous), machine configurations and
number of objective function (single or multi objective). In addition, properties of
mathematical models applied for problems and solution approaches are also
discussed.Bütünleşik Tedarik Zinciri Çizelgeleme (BTZÇ) üzerine yapılan araştırmalar
nispeten yenidir ve bu konu üzerine yapılan çalışma sayısı artmaktadır. Bu çalışma,
bu alandaki eksiklikleri tespit etmeye yardımcı olmak için BTZÇ modelleri hakkında
kapsamlı bir literatür araştırması sunmaktadır. Bu amaçla, bu çalışmanın bu alanda
çalışan araştırmacılara rehberlik etmesi açısından katkı sağlayacağı
düşünülmektedir. Bu çalışmada, BTZÇ problemleri üzerine mevcut literatür gözden
geçirilmiş ve yeni sınıflandırma şeması tanıtılarak çalışmalar özetlenmiştir.
Çalışmalar; tek veya çoklu müşteri sayısı, sipariş büyüklüğü tipi (eşit veya genel),
ürün ömrü (sınırlı veya sınırsız), araç karakteristikleri (sınırlı/yeterli ve
homojen/heterojen), makine konfigürasyonları ve amaç fonksiyonu sayısı (tek veya
çok amaçlı) gibi özellikler dikkate alınarak kategorize edildi. Ayrıca problemler için
uygulanan matematiksel modellerin özellikleri ve çözüm yaklaşımları da
tartışılmıştır
A DECOMPOSITION-BASED HEURISTIC ALGORITHM FOR PARALLEL BATCH PROCESSING PROBLEM WITH TIME WINDOW CONSTRAINT
This study considers a parallel batch processing problem to minimize the makespan under constraints of arbitrary lot sizes, start time window and incompatible families. We first formulate the problem with a mixed-integer programming model. Due to the NP-hardness of the problem, we develop a decomposition-based heuristic to obtain a near-optimal solution for large-scale problems when computational time is a concern. A two-dimensional saving function is introduced to quantify the value of time and capacity space wasted. Computational experiments show that the proposed heuristic performs well and can deal with large-scale problems efficiently within a reasonable computational time. For the small-size problems, the percentage of achieving optimal solutions by the DH is 94.17%, which indicates that the proposed heuristic is very good in solving small-size problems. For large-scale problems, our proposed heuristic outperforms an existing heuristic from the literature in terms of solution quality
On the use of biased-randomized algorithms for solving non-smooth optimization problems
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory management, it is possible to consider stock-outs generated by unexpected demands; and in manufacturing processes and project management, it is frequent that some deadlines cannot be met due to delays in critical steps of the supply chain. However, capacity-, size-, and time-related limitations are included in many optimization problems as hard constraints, while it would be usually more realistic to consider them as soft ones, i.e., they can be violated to some extent by incurring a penalty cost. Most of the times, this penalty cost will be nonlinear and even noncontinuous, which might transform the objective function into a non-smooth one. Despite its many practical applications, non-smooth optimization problems are quite challenging, especially when the underlying optimization problem is NP-hard in nature. In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications. Biased-randomized algorithms extend constructive heuristics by introducing a nonuniform randomization pattern into them. Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions. Moreover, biased-randomized algorithms can be easily parallelized, thus employing short computing times while exploring a large number of promising regions. This paper discusses these concepts in detail, reviews existing work in different application areas, and highlights current trends and open research lines
Efficient Heuristics for Scheduling with Release and Delivery Times
In this chapter, we describe efficient heuristics for scheduling jobs with release and delivery times with the objective to minimize the maximum job completion time. These heuristics are essentially based on a commonly used scheduling theory in Jackson’s extended heuristic. We present basic structural properties of the solutions delivered by Jackson’s heuristic and then illustrate how one can exploit them to build efficient heuristics
Recommended from our members
Minimization of passenger takeoff and landing risk in offshore helicopter transportation: models, approaches and analysis
Offshore petroleum industry uses helicopters to transport the employees to and from installations. Takeoff and landing represent a substantial part of the flight risks for passengers. In this paper, we propose and analyze approaches to create a safe flight schedule to perform pickup of employees by several independent flights. Two scenarios are considered. Under the non-split scenario, exactly one visit is allowed to each installation. Under the split scenario, the pickup demand of an installation can be split between several flights. Interesting links between our problem and other problems of combinatorial optimization, e.g., parallel machine scheduling and bin-packing are established. We provide worst-case analysis of the performance of some of our algorithms and report the results of computational experiments conducted on randomly generated instances based on the real sets of installations in the oil fields on the Norwegian continental shelf. This paper is the first attempt to handle takeoff and landing risk in a flight schedule that consists of several flights and lays ground for the study on more advanced and practically relevant models
Scheduling and Batching in Multi-Site Flexible Flow Shop Environments
Global competition and the customers demand for customized products with shorter due dates, marked the introduction of the Extended Enterprise. In this Extended Manufacturing Environment (EME), lean, virtual, networked and distributed enterprises collaborate to respond to the market demands. In this paper we study the influence of the batch size on Flexible Flow Shop makespan minimization problem FFC vertical bar vertical bar C-max for two multi-sites approaches, the FSBF (Flow Shop Based Factories) and the PMBF (Parallel-Machines Based Factories). The computational study demonstrates how the performance of the PMBF model decreases with the increase of batch size and determines the batch sizes in which the performance is similar.This work is supported by FEDER Funds through the “Programa Operacional Factores de Competitividade - COMPETE” program and by National Funds through FCT “Fundação para a Ciência e a Tecnologia” under the projects: “Projeto Estratégico–UI 252–2011–2012” reference PEstOE/EME/UI0252/2014, FCOMP-01-0124-FEDER-PEstOE/EEI/UI0760/2014.info:eu-repo/semantics/publishedVersio
The relevance of outsourcing and leagile strategies in performance optimization of an integrated process planning and scheduling
Over the past few years growing global competition has forced the manufacturing industries to upgrade their old production strategies with the modern day approaches. As a result, recent interest has been developed towards finding an appropriate policy that could enable them to compete with others, and facilitate them to emerge as a market winner. Keeping in mind the abovementioned facts, in this paper the authors have proposed an integrated process planning and scheduling model inheriting the salient features of outsourcing, and leagile principles to compete in the existing market scenario. The paper also proposes a model based on leagile principles, where the integrated planning management has been practiced. In the present work a scheduling problem has been considered and overall minimization of makespan has been aimed. The paper shows the relevance of both the strategies in performance enhancement of the industries, in terms of their reduced makespan. The authors have also proposed a new hybrid Enhanced Swift Converging Simulated Annealing (ESCSA) algorithm, to solve the complex real-time scheduling problems. The proposed algorithm inherits the prominent features of the Genetic Algorithm (GA), Simulated Annealing (SA), and the Fuzzy Logic Controller (FLC). The ESCSA algorithm reduces the makespan significantly in less computational time and number of iterations. The efficacy of the proposed algorithm has been shown by comparing the results with GA, SA, Tabu, and hybrid Tabu-SA optimization methods
- …