Results 1 to 10 of about 105 (105)
We consider the robust single-source capacitated facility location problem with uncertainty in customer demands. A cardinality-constrained uncertainty set is assumed for the robust problem.
Jaehyeon Ryu, Sungsoo Park
doaj +1 more source
Market-based coordination of price-responsive demand using Dantzig-Wolfe decomposition method
The increasing penetration of Distributed Generation (DG) and Demand Responsive (DR) loads in power systems has necessitated the development of novel approaches to address the coordination problem of Price Responsive Devices (PRD). These PRDs are treated
Foad Najafi, Matthias Fripp
doaj +1 more source
Direct Method for Solving Bilinear Programming Problem
The bilinear programming problem is considered, where a column, which corresponds to one of the variables, is not fixed but can be chosen from a convex set. This problem is known as the Dantzig – Wolfe problem.
L. D. Matveyeva
doaj +1 more source
Decomposition Strategy for Districts as Renewable Energy Hubs
In light of the energy transition, it becomes a widespread solution to decentralize and to decarbonize energy systems. However, limited transformer capacities are a hurdle for large-scale integration of solar energy in the electricity grid.
Luise Middelhauve +2 more
doaj +1 more source
Research on Cloud Task Scheduling Algorithm with Conflict Constraints Based on Branch-and-Price
The low-energy task scheduling of cloud computing systems is a key issue in the field of cloud computing. Nevertheless, existing works on task scheduling lack consideration of the conflict relationship between tasks and focus on heuristic and other ...
Ning Xie +3 more
doaj +1 more source
A Three-Stage Optimization Method for Assembly Line Balancing Problem
Considering the characteristics of multimodels production pattern on assembly line, the assembly line balancing problem which is non-deterministic polynomial hard becomes more challenging to complete. In this article, we propose a reformulation of simple
Qidong Yin, Xiaochuan Luo
doaj +1 more source
The cumulative school bus routing problem: Polynomial‐size formulations
Abstract This article introduces the cumulative school bus routing problem, which concerns the transport of students from a school using a fleet of identical buses. The objective of the problem is to select a drop‐off point for each student among potential locations within a certain walking distance and to generate routes such that the sum of arrival ...
Farnaz Farzadnia +2 more
wiley +1 more source
Matheuristics: survey and synthesis
Abstract In integer programming and combinatorial optimisation, people use the term matheuristics to refer to methods that are heuristic in nature but draw on concepts from the literature on exact methods. We survey the literature on this topic, with a particular emphasis on matheuristics that yield both primal and dual bounds (i.e., upper and lower ...
Marco A. Boschetti +2 more
wiley +1 more source
A survey on emergent trends in the optimization of car‐sharing systems
Abstract This paper reviews the most recent literature on the optimization of car‐sharing systems. Unlike other surveys, we do not focus on a single aspect of car‐sharing systems, but we consider a wide range of optimization problems with a global view. Our aim is threefold.
M. Bruglieri, O. Pisacane
wiley +1 more source
Shipping optimization systems (SOS) for tramp: stochastic cargo soft time windows
Cargo time windows have been discussed in the shipping literature in several ways and within several contexts. One way considers the hard time windows, where a fixed date is assigned to both the open and close laycan for the cargo loading and discharging
Said El Noshokaty
doaj +1 more source

