Search

Global synchromodal transportation is a promising strategy for providing efficient, reliable, flexible, and sustainable container shipping services across continents. It involves integrating multiple modes and routes owned by various operators to create a comprehensive transport plan. However, these operators often have their own local networks and are hesitant to cede control to a centralized platform. Instead, they prefer to share limited information in a coordinated manner to achieve a common goal without sacrificing their own benefits. This paper proposes a coordinated mechanism for global synchromodal transport planning, in which a global operator proposes incentives to local operators to select the most efficient modes and routes for shipping containers from one continent to another. An augmented Lagrangian relaxation approach is developed for the global operator to generate incentives, and a heuristic algorithm is designed to address the computational complexity of the optimization problems faced by local operators. We incorporate the proposed approaches with a rolling horizon framework to handle dynamic shipment requests received from spot markets and with a buffer strategy to address travel time uncertainties. The coordinated mechanism is tested on a real network between Asia and Europe, and results show that it can significantly increase total profits, reduce request rejections, and reduce infeasible transshipments compared to decentralized global transportation plans currently in use, particularly under scenarios with higher degrees of dynamism and uncertainty., Transport Engineering and Logistics, Transport and Planning

This book serves as a comprehensive roadmap for navigating the realm of Operations Research (OR). From laying down fundamental mathematical principles to crafting precise modeling techniques and their solution methods, it culminates in a panoramic view of OR models mirroring real-world operations. Delving into diverse applications-from assignment problems to network problems like graph coloring and minimum spanning trees, and navigating through routing problems that are very common in logistics-the book equips readers with practical insights. Each model is accompanied by meticulously detailed examples, seamlessly integrated with hyperlinked codes accessible via an open repository. Moreover, it introduces an engaging dimension with hyperlinks to three serious games replicating some cornerstone OR models, offering a playful yet educational environment for solo or group experimentation., TU Delft OPEN Textbook, Air Transport & Operations, Transport Engineering and Logistics, Transport and Logistics, Game Lab

Cooperation between container transport service providers can increase efficiency in the logistics sector significantly. However, cooperation between competitors requires co-planning methods that not only give the cooperating partners an advantage towards external competition but also protect the partners from losing information, clients and autonomy to one another. Furthermore, modern freight transport requires real-time methods that react to new information and situations. We propose a real-time, co-planning method called departure learning based on model predictive control where a barge operator considers the joint cost of themselves and a truck operator when deciding barge departures. At regular time-intervals, the barge operator uses previous information to propose a number of departure schedules for which the truck operator discloses their corresponding expected operational costs. Co-planning thus only requires limited exchange of aggregate data. The impact of using departure learning on the transport system’s performance and the method’s learning quality are thoroughly investigated numerically on an illustrative, simulated, realistic hinterland network. With as little as six schedules being exchanged per timestep, departure learning outperforms decentralized benchmark methods significantly in terms of operational costs. It is found that using knowledge about the performance of related schedules is important for the exploration of opportunities, but if this is relied upon too much, the realized solution becomes more costly. It is also found that departure learning is a reliable and realistic co-planning method that especially performs well when peaks in the demand make departure times highly correlated to the cost of operating the transport system, such as in hinterland areas of ports which receive large container ships., Transport Engineering and Logistics

Several measures have been developed to prevent emissions from inland water transportation. However, it is challenging to weigh all the aspects to identify the pathway that will ultimately result in zero-emission inland shipping. A data-driven virtual representation of the inland shipping system can be used to evaluate zero-emission strategies, effectiveness of policies and technologies, and consequences of their implementation. This multi-level digital twin can realistically represent the system with all relevant components, which needs to be validated using real-world data. Subsequently, future scenarios can be imposed on the digital twin, and the proposed intervention measures can be applied, based on which their efficiency can be assessed together with the inland shipping sector. This study discusses the essential aspects of designing a digital twin for an IWT. Three aspects are considered essential: individual ships, logistics chains, and infrastructure. As these research topics span various scales, ranging from a single vessel to an entire infrastructure network, an agent-based approach is suitable for forming the basis of the digital twin. Consequently, potential interventions can be considered, ranging from the application of new technologies to individual vessels to policy measures implemented for an entire shipping corridor or various bunker infrastructure strategies in the network. Additionally, the impact of the implemented interventions can be evaluated at any desired scale, ranging from the individual ship level and its emissions to the network level and aggregated emissions in an entire area, or the impact on the logistics chain., Rivers, Ports, Waterways and Dredging Engineering, Ship Design, Production and Operations, Transport Engineering and Logistics, Transport and Logistics

Container transport via inland waterways currently faces several challenges affecting its competitiveness with other modes. These challenges include the high waiting time experienced by container barges and the low priority given to container barges in deepsea ports. To mitigate these challenges, a new concept known as the Modular Mobile Terminal (MMT) is introduced to create a dedicated floating barge handling and consolidation space for containers in deepsea ports. Based on this, the present study proposes an assessment methodology examining the feasibility of the MMT from a logistical and economic perspective. In doing this, a time optimization model was developed to determine the number of MMTs leading to the most time savings for container barges. It also helps target a market by finding the hinterland flows that can be positively linked to the MMTs. Afterward, an economic evaluation is conducted to determine the cost savings for the actors and determine under which conditions the actors would benefit from using the MMT system. The proposed methodology is then applied in a case study for the ports of Antwerp and Rotterdam to derive insights into the efficiency and profitability of the MMTs. Results revealed that the MMTs would be most suitable for vessels transporting small cargo volumes below 60 Twenty Foot Equivalent Units (TEUs). Furthermore, the analysis suggests that two MMTs would be optimal for the port of Antwerp, and four for the port of Rotterdam, to achieve an overall net benefit for all the actors. Thus, it can be concluded that the MMTs are most suitable for handling and consolidating cargoes from container barges with small call sizes., Transport Engineering and Logistics, Ship Design, Production and Operations

The objective of this study is to address the issue of service time uncertainty in synchromodal freight transport, which can cause delays, inefficiencies, and reduced satisfaction for shippers. The proposed solution is an online deep Reinforcement Learning (RL) approach that takes into account the service time uncertainty, assisted by an Adaptive Large Neighborhood Search (ALNS) heuristic that provides state and reward information based on the routing and scheduling. The proposed planning approach re-plans in response to unexpected events and learns from real-time information from various transport modes, including road, railway, and inland waterways. The performance of the proposed planning approach is evaluated in the European Rhine-Alpine corridor under various scenarios with different types and severities of unexpected events. The results demonstrate that the RL approach consistently outperforms other strategies by effectively handling service time uncertainty, leading to reduced costs, emissions, and waiting time, as well as decreased transport delays and improved rewards through accurate decision-making and agile transport re-planning. This study also finds that incorporating event severity information improves the average reward obtained by the RL approach in scenarios involving multiple types of events., Transport and Planning, Transport Engineering and Logistics

Through the vast adoption and application of emerging technologies, the intelligence and autonomy of smart mobility can be substantially elevated to address more diversified demands and supplies. Along with this trend, a systematic collaboration among three essential elements of smart mobility services, namely devices, data and functions, is being studied to comprehensively break down the intrinsic barriers that existed in current solutions, to support the integration of connectable devices, the fusion of heterogeneous data, the composability of reusable functions, and the flexibility in their cooperations. To enable such a collaboration, this paper proposes a federated platform, called Future Mobility Sensing Advisor (FMSA), which can 1) manage the three elements through standardized interfaces separately and uniformly; 2) create a fully connected knowledge graph to orchestrate the three elements efficiently and effectively; 3) support the client-server interaction in centralized and federated modes to handle service requests and edge resources with various availability and accessibilities jointly and adaptively; and 4) accommodate various mobility services to foster harmonious and sustainable mobility tenderly and invisibly. Moreover, the efficiency and effectiveness of the platform are also tested through a performance evaluation, and a pilot supported at the Great Boston Area, respectively. As a result, it shows that FMSA can 1) achieve high performance by using the two interaction modes selectively, and 2) renovate smart mobility towards sustainability through personalized services that can measure user preferences and system objectives mutually., Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics

Decision-makers in synchromodal transport (ST) have different preferences toward different objectives, such as cost, time, and emissions. To solve the conflicts among objectives and obtain preferred solutions, a preference-based multi-objective optimization model is developed. In ST, containers need to be transferred across modes, therefore the optimization problem is formulated as a pickup and delivery problem with transshipment. The preferences of decision-makers are usually expressed in linguistic terms, so weight intervals, that is, minimum and maximum weights, are assigned to objectives to represent such vague preferences. An adaptive large neighborhood search is developed and used to obtain non-dominated solutions to construct the Pareto frontier. Moreover, synchronization is an important feature of ST and it makes available resources fully utilized. Therefore, four synchronization cases are identified and studied to make outgoing vehicles cooperate with changes of incoming vehicles’ schedules at transshipment terminals. Case studies in the Rhine-Alpine corridor are designed and the results show that the proposed approach provides non-dominated solutions which are in line with preferences. Moreover, the mode share under different preferences is analyzed, which signals that different sustainability policies in transportation will influence the mode share., Transport Engineering and Logistics

Urban mobility services face the challenge of planning their operations efficiently while complying with user preferences. In this paper, we introduce a new mathematical model called a choice-driven dial-a-ride problem (CD-DARP) which is a generalization of the dynamic DARP where passenger behavior is integrated in the operational planning using choice models and assortment optimization. We look at two types of mobility services, private and shared. Our problem extends the dynamic DARP by (i) changing its objective function to profit maximization, where both cost and revenue are variables, and (ii) incorporating assortment optimization with routing decisions in a dynamic setting. We propose a pricing scheme based on a choice model designed to offer service alternatives at the time a customer makes a request. We introduce a tailored algorithm to efficiently solve the dynamic CD-DARP. Computational results indicate that our proposed approach outperforms dynamic DARP in terms of reducing routing costs and improving the number of customers served., Transport and Planning, Transport Engineering and Logistics, Transport and Logistics

In synchromodal transport, a freight forwarder usually serves multiple shippers with heterogeneous and vague preferences, such as low-cost, fast, or reliable transport. Ignoring shippers’ preferences will negatively impact the satisfaction of shippers and lead to the loss of them in the longer run. In order to incorporate these preferences, a Synchromodal Transport Planning Problem with Heterogeneous and Vague Preferences (STPP-HVP) is proposed and formulated as a mathematical model. Heterogeneous and Vague Preferences (HVP) are modeled through Multiple Attribute Decision Making approaches that integrate fuzzy set theory. The proposed model has two objectives, i.e., maximizing the number of served requests and minimizing the transportation cost. Preferences of shippers are set as constraints such that the freight forwarder needs to satisfy the preferred levels for each attribute. A heuristic algorithm (Adaptive Large Neighborhood Search) is proposed to find (near) optimal solutions. The case study in the European Rhine–Alpine corridor demonstrates that the proposed model can provide more attractive solutions to shippers compared with optimization which ignores preferences. Under various scenarios, the attributes, such as cost, time, emissions, reliability, and risk of damage, are analyzed and the (near) optimal modes and routes are suggested according to HVP. Moreover, the results show that the conflicts among attributes, conflicts among shippers, and conflicts between the freight forwarder and shippers are resolved by making one actor more satisfied without compromising any other actor's preferences., Transport Engineering and Logistics

Transport Engineering and Logistics

Transport Engineering and Logistics

Accepted Author Manuscript, Transport Engineering and Logistics

Understanding the modal split in freight transportation is a key factor for the successful implementation of innovations. Mode choice models should then be as representative of reality as possible. The use of disaggregate shipment data can help to achieve it. However, shipment data are often unavailable due to confidentiality issues. As a result, numerous models using only aggregate data have been developed, but their capacity to capture heterogeneity in preferences remains limited. In this paper, we propose a Weighted Logit Mixture model to estimate heterogeneous mode choice preferences of shippers directly from aggregate data. The proposed Weighted Logit Mixture is applied to a case study along the European Rhine-Alpine corridor and allows to estimate the probability distribution of the cost sensitivity among the population. The estimation results show that there exists a substantial variation of the cost sensitivity regarding intermodal transport. The proposed methodology is also compared to a state-of-the-art Weighted Logit model to assess its potential. This reveals that the proposed Weighted Logit Mixture exhibits at least a similar predictive power to the benchmark while achieving a better description of the population’s preferences that enables policy-makers to take better informed decisions and appropriate actions., Transport Engineering and Logistics

This paper considers a coordinated global shipment matching problem in which a global operator receives shipment requests from shippers and three local operators provide local transport services in different geographical areas. While local operators make local matching decisions, the global operator combines the matched local services into itineraries to provide integrated transport for shipments. To handle the interconnecting constraints between different operators, a Lagrangian relaxation heuristic approach is developed. Under the proposed approach, the original problem is decomposed into local operator-related subproblems. These subproblems are optimized iteratively under local constraints as well as under the incentives imposed by the global operator to meet interconnecting constraints. The experiment results show that with the proposed approach, global transport planning that requires coordination among different operators to achieve a common goal can be realized., Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics

Container terminal capacity is often limited by (in)efficiency bottlenecks. This paper provides the design and proof of concept for the bottleneck mitigation cycle (BMC), consisting of three steps: bottleneck classification, detection and alleviation. While, often, the literature only focuses on alleviation of a single bottleneck and ignores bottleneck detection and interdependencies, this research uses the shifting bottleneck method and thereby considers a variety of possible infrastructural and operational bottlenecks. An empirical approach is adopted to find the cause of the detected bottleneck and to suggest suitable alleviation measures. Application of the BMC to a simulation model of the Fergusson Container Terminal in the Port of Auckland resulted in productivity improvements of 2–6%. To further improve the BMC, future research directions are to improve the empirical approach used for bottleneck alleviation and to apply the BMC in real-time., Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics, Transport and Planning, Transport and Logistics

As a critical feature of synchromodal transport (ST), service flexibility plays an important role in improving the utilization of resources to reduce costs, emissions, congestions, and delays. However, none of the existing studies considered flexible services under the framework of synchromodality. This paper develops a Mixed Integer Linear Programming (MILP) model to formulate service flexibility in ST planning. In the MILP model, vehicles with flexible services as well as fixed services are both considered, and vehicle routes and request routes are planned simultaneously. Due to the computational complexity, an Adaptive Large Neighborhood Search heuristic is designed to solve the problem. Several customized operators are designed based on the characteristics of the studied problem. The proposed model is compared with the models developed in a highly-cited paper and a newly published paper that do not consider service flexibility. Case studies on small instances verified that the proposed model with flexibility performs better on all scenarios, including scenarios with different weights for the individual objectives, scenarios under congestion, and dynamic optimization scenarios. On large instances (up to 1600 shipment requests), the proposed model with flexibility reduces the cost by 14% on average compared with the existing models in the literature., Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics

Sustainability is a common concern in intermodal transport. Collaboration among carriers may help in reducing emissions. In this context, this work establishes a collaborative planning model for intermodal transport and uses eco-labels (a series of different levels of emission ranges) to reflect shippers’ sustainability preferences. A mathematical model and an Adaptive Large Neighborhood Search heuristic are proposed for intermodal transport planning of carriers and fuzzy set theory is used to model the preferences towards eco-labels. For multiple carriers, centralized, auction-based collaborative, and non-collaborative planning approaches are proposed and compared. Real data from barge, train and truck carriers in the European Rhine-Alpine corridor is used for extensive experiments where both unimodal carrier collaboration and intermodal carrier collaboration are analyzed. Compared with non-collaborative planning without eco-labels, the number of served requests increases and emissions decrease significantly in the collaborative planning with eco-labels as transport capacity is better utilized., Transport Engineering and Logistics

It is desirable to improve the efficiency of container transport both from an economical and an environmental point of view, as increased efficiency decreases costs and emissions per transported container. Modern transport schemes, such as synchromodal transport, use a-modal bookings to increase the flexibility of the transport providers where the mode choice can be postponed until all demand for a planning period is known. We show in this paper the impact of planning the routes of containers, and thus the mode choice, together with truck routing. The developed integrated container and truck routing model is compared to a two-stage model that represents current practice, where the route of the containers are decided upon assuming an unlimited amount of trucks are always available. The two models are compared on several simulated, hinterland scenarios. In all scenarios, integrated routing performs at least as well as the two-stage model in terms of cost and the benefits of integration are more evident when there is a limited amount of trucks available. Integration of the routing increases the utilization rate of trucks and, often, a smaller truck fleet is needed. The presented model, therefore, demonstrates a proof-of-concept with promising improvements towards efficiency and environmental sustainability., Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics

The quality of the delivery service is a crucial asset for an e-grocer to create and maintain a loyal customer-base. With the rapid market growth of e-grocers over the last decade, there is an urgent need for e-grocer specific routing systems. Although stochastic and dynamic routing models are studied for a wide range of applications, e-grocer specific models are missing in the literature. This paper investigates the concept of flexible deliveries, which introduces differentiated time window sizes. This creates the possibility for real-time re-optimization of the sequence of customers in a trip in order to improve the on-time delivery performance. The potential of flexible deliveries is investigated by means of computational experiments in which historic trip instances from the Dutch e-grocer Picnic are used. It is shown that, when re-optimization is activated, on-time delivery performance is improved and this benefit is significant when flexible deliveries represent at least 10% of the deliveries. When 10% of the deliveries are flexible, the number of late deliveries can be reduced by up to 18% and the number of extreme late deliveries (≥15 min late) up to 27%. This improved on-time delivery performance comes at the cost of a maximum of 2% increase in the average time spent per delivery., Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport and Planning, Transport Engineering and Logistics

This paper proposes a simulation-based optimization technique for high-dimensional toll optimization problems of large-scale road networks. We formulate a novel analytical network model. The latter is embedded within a metamodel simulation-based optimization (SO) algorithm. It provides analytical and differentiable structural information of the underlying problem to the SO algorithm. Hence, the algorithm no longer treats the simulator as a black box. The analytical model is formulated as a system of nonlinear equations that can be efficiently evaluated with standard solvers. The dimension of the system of equations scales linearly with network size. It scales independently of the dimension of the route choice set and of link attributes such as link length. Hence, it is a scalable formulation suitable for the optimization of large-scale networks. For instance, the model is used in the case study of the paper for toll optimization of a Singapore network with more than 4,050 OD (origin-destination) pairs and 18,200 feasible routes. The corresponding analytical model is implemented as a system of 860 nonlinear equations. The analytical network model is validated based on one-dimensional toy network problems. It captures the main trends of the simulation-based objective function and, more importantly, accurately locates the global optimum for all experiments. The proposed SO approach is then used to optimize a set of 16 tolls for the network of expressways and major arterials of Singapore. The proposed method is compared with a general-purpose algorithm. The proposed method identifies good quality solutions at the very first iteration. The benchmark method identifies solutions with similar performance after 2 days of computation or similarly after more than 30 points have been simulated. The case study indicates that the analytical structural information provided to the algorithm by the analytical network model enables it to (i) identify good quality solutions fast an, Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics

Transport of containers on a-modal bookings enables transport suppliers to route the containers in accordance with the current state of the synchromodal transport network. At the same time, it enables the transport providers to route their vehicles in real time based on the current need for transportation. The interdependency of the routes of containers and of vehicles has not yet been discussed explicitly in the synchromodal literature. This paper presents a model predictive controller that determines which combination of trucks, trains, and ships to use for transporting the containers and what routes empty and full trucks should use as one integrated problem. The impacts of this integrated problem as opposed to only considering the routes of the containers are shown with experiments on a simulated synchromodal hinterland network performed with both the proposed method and with a method that solely routes the containers. The results indicate an improved vehicle utilization. Furthermore, the integrated problem approach allows for more realistic constraints and costs., Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Transport Engineering and Logistics

This paper investigates a dynamic and stochastic shipment matching problem faced by network operators in hinterland synchromodal transportation. We consider a platform that receives contractual and spot shipment requests from shippers, and receives multimodal services from carriers. The platform aims to provide optimal matches between shipment requests and multimodal services within a finite horizon under spot request uncertainty. Due to the capacity limitation of multimodal services, the matching decisions made for current requests will affect the ability to make good matches for future requests. To solve the problem, this paper proposes an anticipatory approach which consists of a rolling horizon framework that handles dynamic events, a sample average approximation method that addresses uncertainties, and a progressive hedging algorithm that generates solutions at each decision epoch. Compared with the greedy approach which is commonly used in practice, the anticipatory approach has total cost savings up to 8.18% under realistic instances. The experimental results highlight the benefits of incorporating stochastic information in dynamic decision making processes of the synchromodal matching system., Transport Engineering and Logistics

Container transport requires real-time control and a high degree of cooperation to alleviate disturbances and perform smoothly without unnecessary environmental impact and monetary losses. The involved operators are, however, often reluctant to cooperate as they fear loosing valuable information and autonomy, eventually leading their clients to choose another (cooperating) operator. In this paper we propose a real-time co-planning method, called Secure Departure Learning that in real-time lets several truck operators indicate to a barge operator what departure schedules they prefer without revealing any sensitive information. The method uses Paillier encryption and a learning method inspired by Bayesian Optimization in a model predictive control framework. At frequent time intervals a number of potential barge schedules are communicated to the co-planning truck operators. They evaluate their operation cost for each schedule and communicate it to the barge operator encrypted using several public keys. The barge operator computes the encrypted total cost for each schedules, which hereafter is decrypted by several truck operators. The first action of the schedule that results in the lowest total cost is implemented in a model predictive control fashion. Simulated experiments on a realistic, Dutch transport network illustrate that Secure Departure Learning is a good alternative for replacing the current method in practice, where barge departures are scheduled ahead of time and only mode-decisions can be updated in real time. Secure Departure Learning offers a new perspective on cooperation at the operational level in freight transport where co-planning and information protection can go hand in hand., Transport Engineering and Logistics

This paper investigates a dynamic and stochastic shipment matching problem, in which a platform aims to provide online decisions on accepting or rejecting newly received shipment requests and decisions on shipment-to-service matches in global synchromodal transportation. The problem is considered dynamic since the platform receives requests and travel times continuously in real time. The problem is considered stochastic since the information of requests and travel times is not known with certainty. To solve the problem, we develop a rolling horizon framework to handle dynamic events, a hybrid stochastic approach to address uncertainties, and a preprocessing-based heuristic algorithm to generate timely solutions at each decision epoch. The experimental results indicate that for instances with above 50% degrees of dynamism, the hybrid stochastic approach that considers shipment request and travel time uncertainties simultaneously outperforms the approaches that do not consider any uncertainty or just consider one type of uncertainties in terms of total profits, the number of infeasible transshipments, and delay in deliveries., Transport Engineering and Logistics

In this paper, we address a multi-objective residential waste collection problem with an integrated territory planning and vehicle routing approach. Dividing the problem into territories enables drivers to carry out the same route every week so they get familiar with it and residents put out their bins at the appropriate time. Another benefit is to reduce the computation time for large problems, since the complex characteristics of the involved vehicle routing problem make it otherwise difficult to solve. There are three characteristics that are important for good territory planning: minimum overlap, minimum travel time, and balanced workload. The purpose of this paper is to investigate the influence these three objectives have on each other, since they might be contradictory. Moreover, an Adaptive Large Neighborhood Search (ALNS) algorithm is developed for this specific problem which uses a K-means algorithm to generate the initial solution for territories. The results with the three objectives are shown to be useful for planners seeking to make informed decisions through the trade-off across different solutions with the Pareto frontiers provided. Moreover, the ALNS algorithm is shown to find good quality solutions in a reasonable computational time., Transport and Logistics, Transport Engineering and Logistics

This paper analyzed the market developments and identified the current situation and challenges of container barge transport in deepsea and inland terminals. It was revealed that the major challenges of container IWT include; inefficient handling of barges, poor planning and coordination, lack of flexibility in container barge transport and low water levels. To solve these challenges, innovative solutions such as mobile terminals, vessel trains, cargo reconstruction, and smart navigation are proposed. The impact of these innovations is currently being examined by using the discrete event simulation (DES) model., Transport Engineering and Logistics

The use of containers in the freight transport system has increased dramatically over the years. This is as a result of the interplay between macro-- and microeconomic factors and the liberalization of markets, thereby enhancing the development of international logistics services within transportation systems. The physical distribution of cargo in this system involves an integrated logistics chain process to transport the containerized goods from the production location to the consumption location. Different logistics chain models have been used to examine the flow of the containerized goods from origin to destination, however, these models mostly capture a specific module of the chain. To address this, the paper examines the whole logistics chain by linking the interaction between the logistics cost, time, mode choice and assignment to the network, while connecting with the different innovations that could make container IWT more competitive. In doing this, a conceptual logistics model is developed which includes the logistics cost, time, and mode choice sub-models. The two first sub-models are developed at a disaggregated level to examine the logistics decisions for the individual cargoes. The logistics decisions are derived from the minimization of transport-related costs and time and form the input of the mode choice and assignment sub-models., Transport Engineering and Logistics