The Container Drayage Problem (CDP) aims at routing a fleet of trucks, based at a common terminal, to serve customers while minimizing the total travel distance. Each trip starts from and ends at the terminal, and handles a subset of customers. Each customer requires either that a container is picked up or delivered. We introduce a more realistic variant, i.e., the Multi-trip Multi-period CDP with

With the rapid development of e-commerce and the new retail, the same-day or even same-half day delivery service is provided to compete for market share. Recently, an increased number of e-commerce companies implement the unmanned smart warehouses to improve the logistics efficiency. In order to further reduce the demand response time, a novel picking strategy is designed to firstly split the orders

Longest common subsequence problems find various applications in bioinformatics, data compression and text editing, just to name a few. Even though numerous heuristic approaches were published in the related literature for many of the considered problem variants during the last decades, solving these problems to optimality remains an important challenge. This is particularly the case when the number

The Shapley value is one of the most important solution concepts in cooperative game theory, it satisfies uniqueness and fairness properties while its main drawback lies in its high computational complexity. A number of approximation methods have been provided to overcome such intractability. Monte Carlo type methods are the most general and practical approaches approximating the Shapley value thanks

Navigating through an airport is easy enough for most passengers, but when you are reduced in mobility it is a different story. In this paper we look at an airport at which between 300 and 500 Passengers with Reduced Mobility (PRMs) arrive daily, who need assistance from airport employees in their journey. We want to find a schedule for these employees to support as many PRMs as possible while ensuring

In Resource Constrained Project Scheduling Problems (RCPSPs), it is usually assumed that the activity durations are known and integers. This assumption helps to conveniently develop a standard mathematical model, using discrete time steps. However, in reality, activity durations may not only be integer, and they may not be known with certainty at the time of project planning. The consideration of real-valued

This paper deals with the capacitated version of discrete ordered median problems. We present different formulations considering three-index variables or covering variables to address the order requirements in this problem. Some preprocessing phases for fixing variables and some valid inequalities are developed to enhance the initial formulations. Finally, an extensive computational analysis is addressed

This study addresses a stochastic customer order production problem in cellular manufacturing systems with parallel machines. The objective is to minimize the long-run expected makespan of stochastic customer orders via proper cellular manufacturing system designs under a budget limit. Theoretical studies are conducted to explore the effect of demand uncertainty and production requirement on the optimal

In this paper we investigate the problem of simultaneously allocating orders and mobile storage racks to static pickers. Here storage racks are allocated to pickers to enable them to pick all of the products for the orders that have been allocated to them. Problems of the type considered here arise in facilities operating as robotic mobile fulfilment systems. We present a formulation of the problem

The Electric Vehicle Routing Problem with Time Windows and Stochastic Waiting Times at Recharging Stations is an extension of the Electric Vehicle Routing Problem with Time Windows where the electric vehicles (EVs) may wait in a queue before the recharging service starts due to limited number of chargers available at stations. Since the customers and the depot are associated with time windows, long

This paper proposes an iterated local search (ILS) based heuristic for the weighted vertex coloring problem (WVCP). Given a graph G(V,E) with a weight w(v) associated with each vertex v∈V, the WVCP asks to find a coloring {V1,…,Vk} of G that minimizes ∑i=1kmaxv∈Viw(v). This problem has many theoretical and practical applications, such as batch scheduling, buffer minimization, and traffic assignment

We present a risk-averse two-stage stochastic programming model for the planning of a hybrid energy system with conventional hydropower component. Using Conditional Value-at-Risk as our measure of risk-aversion, we take into consideration the dispersion of the random total cost arising due to uncertain streamflow amount. We propose an exact solution approach based on scenario decomposition to solve

This paper integrates energy awareness in the flexible flow shop scheduling system, where two objectives are minimized simultaneously: total tardiness and electric power costs. We also consider practical settings including variable processing speeds and time-of-use (TOU) electricity prices. A novel hybrid particle swarm optimization (HPSO) algorithm is developed which incorporates several distinguishing

In stochastic online scheduling problems, a common class of policies is the class of fixed assignment policies. These policies first assign jobs to machines and then apply single machine scheduling policies for each machine separately. We consider a stochastic online scheduling problem for which the goal is to minimize total weighted expected completion time on uniform parallel machines. To solve the

Cities suffer from high traffic congestion of which one of the main causes is the unorganized pursuit for available parking. Apart from traffic congestion, the blind search for a parking slot causes financial and environmental losses. We consider a general parking allocation scenario in which the GPS data of a set of vehicles, such as the current locations and destinations of the vehicles, are available

This paper studies a real-time parking-sharing program with which owners of private parking spaces can lend out their parking spaces to other drivers to park when these are not in use. Compared with curbside and garage parking problems, the information of supplies and demands is randomly announced by drivers and owners respectively via a parking-sharing APP installed on their smartphones. Besides,

This paper addresses a technician routing and scheduling problem motivated by an application for the repair and maintenance of electronic transactions equipment. The problem exhibits many special features like multiple time windows for service, an inventory of spare parts carried by each technician and tasks that may require a special part to be performed. A problem-solving methodology based on tabu

Multi-stage semi-open queuing networks (SOQNs) are widely used to analyze the performance of multi-stage manufacturing systems and automated warehousing systems. While there are several methods available for solving single-stage SOQNs, solution methods for multi-stage SOQNs are limited. Decomposition of a multi-stage SOQN into single-stage SOQNs and evaluation of an individual single-stage SOQN is

Multi-depot routing problems mainly arise in distribution logistics where a fleet of vehicles are used to serve clients from a number of (potential) depots. The problem concerns deciding on the routes of each vehicle and the depots from which the vehicles depart, so as to minimize the total cost of travel. This paper reviews a number of existing compact formulations, and proposes new ones, for two

We consider a retail firm selling a durable product in a volatile market where the demand is price-sensitive and random but its distribution is unknown. The firm dynamically replenishes inventory and adjusts prices over time and learns about the demand distribution. Assuming that the demand model is of the multiplicative form and unmet demand is partially backlogged, we take the empirical Bayesian

This paper is a note on [Quispe, K. E. Y., Lintzmayer, C. N., & Xavier, E. C. (2018). An exact algorithm for the blocks relocation problem with new lower bounds. Computers & Operations Research, 99, 206–217]. Quispe et al. (2018) presented a new lower bound called LB-LIS for the blocks relocation problem. In this note, we show that the algorithm description of LB-LIS in the referred paper is incomplete

This paper addresses the vehicle routing problem with time windows and multiple deliverymen (VRPTWMD) under uncertain demand as well as uncertain travel and service times. This variant is faced by logistics companies that deliver products to retailers located in congested urban areas, where service times are relatively long compared to travel times, and depend on the number of deliverymen assigned

The approximate dynamic programming (ADP) method based on the design and analysis of computer experiments (DACE) approach has been demonstrated as an effective method to solve multistage decision-making problems in the literature. However, this method is still not efficient for infinite-horizon optimization considering the required large volume of sampling in the state space and high-quality value

This paper addresses a generalized version of the facility location problem with customer preferences which includes an additional constraint on the number of customers which can be allocated to each facility. The model aims to minimize the total cost due to opening facilities and allocating customers while taking into account both customer preferences for the facilities and these cardinality constraints

We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both vehicles’ services, whose service start times at the customer are synchronized. Despite its important real-world application, this problem has rarely been studied

There are several mathematical models proposed for the facility location and production planning problem in the literature. However, some of these models disregard what products each customer has ordered and neglect critical production-related constraints and setup decisions while some others do not well define the connection cost between customers and facilities. In this study, we propose two mathematical

In this paper, we consider a pricing problem faced by a seller that sells a given inventory of some product over a short selling horizon with limited demand information. The seller knows only that the demand is a linear function of the price, but does not know the parameters involved in the demand function. However, the seller knows that each parameter involved in the demand function belongs to a known

In the present work, we study the Pickup and Delivery Problem with Time Windows, which generalizes the well-known Vehicle Routing Problem and has many potential applications to transportation services. The contributions span from an improved hybrid algorithm with a mathematical programming component (matheuristic) to a new method to generate instances for routing problems based on open data. We further

Although lead time variation is common in practice, integrated single-manufacturer multi-buyer model considering this factor is unavailable in the extant literature. This article considers generic distribution of lead times of delivering equal and/or unequal batch (sub-lot) sizes of a lot in developing a synchronised integrated single-manufacturer multi-buyer model. The batch sizes are assumed to be

We study a generalization of the Skill VRP that incorporates time windows aspects, precedence and synchronization constraints. Specifically, we are given a logistic network where nodes correspond to customers, and where each customer requires a set of (partially ordered) operations. A set of technicians is available to perform such operations, and each technician is qualified to execute only a subset

Assembly lines are mass production systems which are significant in the industrial production of both standard and customised products. Currently, industrial companies offer several products and it is common for an assembly system to have multiple assembly lines. Parallel assembly lines are multiple lines located in such a way as to allow improvements in the system’s efficiency through the use of common

This paper addresses a problem regarding the joint decision of process planning and scheduling in the context of a distributed flexible job shop (DFJS). The joint decision is called integrated process planning and scheduling (IPPS). Therefore, the problem is called an IPPS/DFJS problem. This research develops a genetic algorithm (called GA_X) to solve the IPPS/DFJS problem. The GA_X algorithm is meritorious

This article addresses a reorder point method with an extended inventory position. The inventory position is decreased by near future known demand spikes. This advance demand information helps to improve the performance of the reorder point method. The proposed extension leads to a hybrid model: make-to-stock for demand less than the spike threshold and make-to-order for demand greater than the spike

This article discusses the precedence-constrained class sequencing problem (PCCSP). In scheduling terms, this is a single-machine problem with precedence constraints and family setups with the goal of minimizing the number of setups. From a practical perspective, PCCSP covers a wide range of applications such as, for example, scheduling problems in systems with job families where multipurpose processors

Hub location models are one of the basic concepts to model design problems for communication and traffic networks. These networks are often exposed to threats such as attacks or natural disasters. However, the literature on extensions of hub location models capable of taking such threats into account is scarce. In this article, we investigate the so-called multiple allocation p-hub r-interdiction problem

The Three-dimensional Single Large Object Placement Problem consists of a set of weakly heterogeneous items that must be placed inside a single larger object without overlapping each other. Many constraints can be considered depending on the practical specifications of the problem being solved, such as orientation, stability, weight limit and positioning. Although this is a well-known problem which

In this paper, we present a new integrated optimization model and a greedy algorithm for generating patterns, directly derived from original data instead of binarized data, in logical analysis of data (LAD). Pattern generation, following data discretization (binarization) and support set selection to handle non-binary data, is a building block that largely influences LAD classification. These stand-alone

In recent years, the multi-manned assembly line has become popular since the large-sized products allow more than one operator working simultaneously on the same product in a workstation. This line usually occurs in large-size products such as cars, buses, trucks, and so on. The multi-manned assembly line offers several advantages, such as fewer number of workers/workstation and less cycle time to

When continuously monitoring processes over time, data is collected along a whole period, from which only certain time instants and certain time intervals may play a crucial role in the data analysis. We develop a method that addresses the problem of selecting a finite and small set of short intervals (or instants) able to capture the information needed to predict a response variable from multivariate

In this paper, a new variant of the Simple Plant Location Problem is proposed. We consider additional conditions in the classic location-allocation problem for clients and facilities. Namely, some pairs have to be served by a common plant. The resulting problem can be addressed with existing models for the case of single assignment. However, to the best of our knowledge, the proposed setting when each

The p-median problem is one of the true classic problems of location science and has been applied in many ways. It involves the location of p-facilities on a network where the objective is to minimize the weighted distance of serving all demand. This problem was originally proposed by Hakimi (1964, 1965) where the facilities were telephone switching centers and the connections represent wire stretched

This study contributes to identifying valid barriers and proposes a model to understand the challenges to Industry 4.0 in circular economy to obtain social, economic and environmental benefits in practice. Industry 4.0 and circular economy have a mutual effect in practice. Hence, this study aims to investigate how to impede the challenges of Industry 4.0 in circular economy in the context of the palm

When modelling a given problem using integer linear programming techniques several possibilities often exist, each resulting in a different mathematical formulation of the problem. Usually, advantages and disadvantages can be identified in any single formulation. In this paper we consider mixed integer linear programs and propose an approach based on Benders decomposition to exploit the advantages

Real-time path planning for large, dense grid-based automated guided vehicle (AGV) systems, used for example to sort parcels, is challenging. Most approaches described in the literature are not fast enough for real-time control or are not able to avoid congestion. This paper presents a dynamic approach using a graph-representation of the grid system layout with vertex weights that are updated over

The circulation efficiency of the fresh agricultural product supply chain is greatly influenced by the purchasing power of end consumers. In this paper, a method to coordinate a fresh agricultural product supply chain with the consideration of strategic consumer behavior is proposed. First, considering the characteristics of the fresh agricultural products supply chain, the utility function of consumers

Maritime inventory routing problems involve determining optimal routes for seagoing vessels between ports while managing the inventory of each port. Normally, such problems are considered with the vessels operating at fixed sailing speeds. However, the speed of vessels can typically be adjusted within an interval, and the actual fuel consumption depends on both the load and the speed of the vessel

The stable set problem is a fundamental combinatorial optimisation problem, that is known to be very difficult in both theory and practice. Some of the solution algorithms in the literature are based on 0-1 linear programming formulations. We examine an entire family of such formulations, based on so-called clique and nodal inequalities. As well as proving some theoretical results, we conduct extensive

Manual short-term scheduling in underground mines is a time-consuming and error-prone activity. In this work, we present a Constraint Programming approach capable of automating the short-term scheduling process in a cut-and-fill mine. The approach extends previous work by accounting for fleet travel times, and thus captures an important aspect of the real-world machine scheduling problem. We introduce

The utilization of real-time information in production scheduling decisions becomes possible with the help of new developments in Information Technology and Industrial Informatics, such as Industry 4.0. Regardless of the beliefs that the availability of such information will enhance scheduling decisions, several questions and concerns have been reported. One such question is to what extent can the

Taking fairness concerns of retailer into account, we extend the classical newsvendor model to a new type with Nash bargaining preference. Depending on the demand forms, three models are proposed: one benchmark case for deterministic demand, and two stochastic demand cases for multiplicative and additive patterns, respectively. We theoretically prove the existence and uniqueness of the optimal joint

This paper proposed a novel approach for a practical version of the cold chain, namely location-routing problem-based low-carbon cold chain (LRPLCCC). In the proposed bi-objective model, the first objective is the total logistics cost, including the fixed costs of the opened depots and leased vehicles, as well as the cost of fuel consumption and carbon emissions, and the second is to minimize the amount

To pick up a container from a container terminal, other containers may need to be relocated to other positions. In practice, these relocation moves are usually done when it is busy at a terminal. However, if the crane is idle for some amount of time, it may be more efficient to execute some pre-processing moves to reduce the number of future relocation moves. In this paper, we propose a model for optimal

The production routing problem (PRP) is a difficult optimization problem which arises in the planning of integrated supply chains. The purpose of solving the PRP is the simultaneous optimization of the production, inventory, distribution, and routing decisions, which typically appears in vendor managed inventory systems. In this study, the classical PRP is extended by considering transshipments, either

In many revenue management applications risk-averse decision-making is crucial. In dynamic settings, however, it is challenging to find the right balance between maximizing expected rewards and minimizing various kinds of risk. In existing approaches utility functions, chance constraints, or (conditional) value at risk considerations are used to influence the distribution of rewards in a preferred

In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling problem with sequence flexibility in which precedence constraints among operations of a job are given by an arbitrary directed acyclic graph. In addition, several complicating particularities such as periods

The Team Orienteering Problem with Time Windows (TOPTW) is an extension of the well-known Orienteering Problem. Given a set of locations, each one associated with a profit, a service time and a time window, the objective of the TOPTW is to plan a set of routes, over a subset of locations, that maximizes the total collected profit while satisfying travel time limitations and time window constraints

The bike repositioning and recycling problem (BRRP) is significant to develop a sustainable bike-sharing system and can effectively reduce the imbalance between demand and supply. This study investigates the static repositioning and recycling problem of a bike-sharing system, which is formulated as an integer linear programming model. The BRRP is a variant of the multi-depot simultaneous pickup and

Natural catastrophes with their widespread damage can overwhelm the financial systems of large communities. Catastrophe insurance is a well-understood financial risk transfer mechanism, aiming to provide resilience in the face of adversity. However, catastrophe insurance has generally a low penetration, mainly due to its high cost or to distrust of the product in providing a fast financial recovery