Search results for "programming"
showing 10 items of 3090 documents
Exact solution of the soft-clustered vehicle-routing problem
2020
Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) extends the classical capacitated vehicle-routing problem by one additional constraint: The customers are partitioned into clusters and feasible routes must respect the soft-cluster constraint, that is, all customers of the same cluster must be served by the same vehicle. In this article, we design and analyze different branch-and-price algorithms for the exact solution of the SoftCluVRP. The algorithms differ in the way the column-generation subproblem, a variant of the shortest-path problem with resource constraints (SPPRC), is solved. The standard approach for SPPRCs is based on dynamic-programming labeling algorithms. We s…
New exact methods for the time-invariant berth allocation and quay crane assignment problem
2019
Abstract Efficient management of operations in seaport container terminals has become a critical issue, due to the increase in maritime traffic and the strong competition between ports. In this paper we focus on two seaside operational problems: the Berth Allocation Problem and the Quay Crane Assignment Problem, which are considered in an integrated way. For the continuous BACAP problem with time-invariant crane assignment we propose a new mixed integer linear model in which the vessels can be moored at any position on the quay, not requiring any quay discretization. The model is enhanced by adding several families of valid inequalities. The resulting model is able to solve instances with u…
The berth allocation problem in terminals with irregular layouts
2019
As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and departure of vessels. Although significant research has been conducted regarding the BAP, these real-world restrictions have not been taken into account in a general way. The present work …
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
2017
Abstract With their paper “Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be solved iteratively when vehicle routing and scheduling problems are tackled via Lagrangian relaxation or column-generation techniques. Righini and Salani and several subsequent works have shown that bounded bidirectional DP algorithms are often superior to their monodirectional counterparts, s…
Determining the best shipper sizes for sending products to customers
2014
A distribution company has to send products, packed into shippers, from the warehouse to retail shops. The number of different shipper types is regarded as a parameter given by the user, who is looking for a balance between transportation costs and stock and procurement costs. The problem is to decide the sizes of the shipper types to keep at the warehouse so as to minimize the cost of meeting the forecasted demand over the planning horizon. In this paper, we describe an integer linear programming formulation for the problem and obtaining feasible solutions. Other models, based on multiknapsack and p-median and facility location models, are for obtaining lower bounds. We study several ways …
Cimo: An efficient 2-phases calculator of multimodal itineraries for real trans-territories based on a dynamic programming
2015
In this work we propose an exact solution for calculating multimodal itinerary. This solution is named Cimo (Calculateur d'Itineraires Multimodaux Ordonnes). Cimo is an exact optimal itineraries' calculator wherein itineraries are sorted, multimodal, and trans-territorial. The solution is based on a dynamic programming algorithm "cut", "price" and "share". This solution is multi-objectives and multi-constraints. Several versions of this algorithm are proposed following a methodological approach that enables evaluation of efficiency and complexity's gain : through theoretical calculus and benchmarks. In the first version of realistic problem, we propose a solution with itineraries calculated…
Competition and cooperation for intermodal container transhipment: A network optimization approach
2018
Abstract This study presents an analysis of cross-border competition and cooperation between ports in Bangladesh and India. Nepal and Bhutan are countries without access to seaports — two landlocked countries in South Asia, depending solely on the Indian port of Kolkata for their international seaborne trade. Alternatives do exist in the Bangladeshi ports of Chittagong and Mongla but these are not exploited, in spite of trade agreements that allow access to a third country's port, and/or crossing the land of a third, intermediate, country. We formulate a mixed integer linear programming optimization model to find the optimum economic benefit of port users (serving Bhutan, Nepal and Northeas…
Surrogate Measures of Safety at Roundabouts in AIMSUN and VISSIM Environment
2018
This paper addresses issues on road safety analysis through microscopic traffic simulation models. The Surrogate Safety Assessment Model (SSAM) was applied to read vehicle trajectory files generated by two micro-simulators and then calculate surrogate measures of safety. Since safety assessment of any road entity can provide different results based on the micro-simulator which is used, the main objective of this research was to estimate the safety performance of three roundabout layouts and compare the conflict events simulated by AIMSUN and VISSIM. The two micro-simulators were used to build the calibrated models of the roundabouts, each fitting the corresponding empirical capacity functio…
Mafia Methods, Extortion Dynamics and Social Responses
2016
This chapter is devoted to exploring both the empirical results and the policy proposals produced by the GLODERS project. Based on 631 cases of extortions, the Sicily and Calabria extortion database represents a relevant achievement in the field of the research on extortion racket and it is one of the main results of the GLODERS project. Gathering a great amount of information, our empirical analysis revealed the existence of several differences in the extortive conducts carried on within these two regions, which are presented. Moreover, the chapter introduces the legislation related to the crime of extortion. Social and legal responses to the phenomenon are then discussed.
The relationship between loading history and proximal femoral diaphysis cross-sectional geometry
2017
Objectives We investigated the relationship between loading history and bone biomechanical properties used in physical activity reconstructions. These bone properties included bone bending and torsional strength (J), cortical area (CA), the direction of the major axis (theta angle), and element shape ratios determined from cross sections of standardized bone length. In addition, we explored the applicability of anatomically determined cross sections. Methods Our material consisted of hip and proximal thigh magnetic resonance images of Finnish female athletes (N = 91) engaged in high-jump, triple-jump, endurance running, swimming, power-lifting, soccer and squash; along with a group of activ…