Search results for "integer programming"
showing 9 items of 69 documents
The Multi-period Multi-trip Container Drayage Problem with Release and Due Dates
2021
Abstract 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 Release and Due Dates (MM-CDP-RDD), in which the planning horizon is composed of several periods (days). On each day, each truck may perform more than one trip respecting the Release and Due Dates (RDD) associated with customer services, corresponding to the first and the last day on whic…
Decorous combinatorial lower bounds for row layout problems
2020
Abstract In this paper we consider the Double-Row Facility Layout Problem (DRFLP). Given a set of departments and pairwise transport weights between them the DRFLP asks for a non-overlapping arrangement of the departments along both sides of a common path such that the weighted sum of the center-to-center distances between the departments is minimized. Despite its broad applicability in factory planning, only small instances can be solved to optimality in reasonable time. Apart from this even deriving good lower bounds using existing integer programming formulations and branch-and-cut methods is a challenging problem. We focus here on deriving combinatorial lower bounds which can be compute…
A comprehensive tool for efficient design and operation of polygeneration-based energy μgrids serving a cluster of buildings. Part I: Description of …
2013
Polygeneration systems with thermal energy storage represent promising solutions to achieve energy saving and emissions reduction in the civil sector. The definition of customer-oriented design and operation strategies represents a most challenging task, in order to maximize the profitability and make the investment attractive. A large potential is often recognized for the installation of centralized plants serving a cluster of buildings located over a small area; in such cases the design problem becomes extremely complex and the analyst needs reliable instruments to identify the optimal solution. This paper in two parts presents a scientific tool for the optimization of design and operatio…
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models
2020
Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle-routing problems solved by branch-price-and-cut algorithms, it is possible to fix to zero the variables associated with all routes containing at least one arc from a subset of arcs determined according to the dual solution of a linear relaxation. This is equivalent to removing these arcs from the network used to generate the routes. In this paper, we extend this technique to routes containing sequences of two arcs. Such sequences or their arcs cannot be removed directly from the network because routes traversing only one arc of a sequence might still b…
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
2021
AbstractThe Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both…
Symbolic Worst Case Execution Times
2011
In immediate or hard real-time systems the correctness of an operation depends not only upon its logical correctness, but also on the time in which it is computed. In such systems, it is imperative that operations are performed within a given deadline because missing this deadline constitutes the failure of the complete system. Such systems include medical systems, flight control systems and other systems whose failure in responding punctually results in a high economical loss or even in the loss of human lives. These systems are usually analyzed in a sequence of steps in which first, a socalled control flow graph (CFG) is constructed that represents possible program flows. Furthermore, bou…
Energy Management Systems and tertiary regulation in hierarchical control architectures for islanded microgrids
2015
In this paper, the structure of the highest level of a hierarchical control architecture for micro-grids is proposed. Such structure includes two sub-levels: the Energy Management System, EMS, and the tertiary regulation. The first devoted to energy resources allocation in each time slot based on marginal production costs, the latter aiming at finding the match between production and consumption satisfying the constraints set by the EMS level about the energy production in each time slot. Neglecting the efficiency of the different energy generation systems as well as that of the infrastructure for electrical energy distribution, the problem dealt with by the EMS sub-level is linear and can …
The Multiple Multidimensional Knapsack with Family-Split Penalties
2021
Abstract The Multiple Multidimensional Knapsack Problem with Family-Split Penalties (MMdKFSP) is introduced as a new variant of both the more classical Multi-Knapsack and Multidimensional Knapsack Problems. It reckons with items categorized into families and where if an individual item is selected to maximize the profit, all the items of the same family must be selected as well. Items belonging to the same family can be assigned to different knapsacks; however, in this case, split penalties are incurred. This problem arises in resource management of distributed computing contexts and Service Oriented Architecture environments. An exact algorithm based on the exploitation of a specific combi…
Data for: Decorous Combinatorial Lower Bounds for Row Layout Problems
2021
Files of the new randomly generated instancesnlengths of the departmentsmatrix with the transport weights THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOVE