Results 81 to 90 of about 37,139 (224)
An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem
Mathematics, 2018 Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications.
Tamer F. Abdelmaguid
doaj +1 more source
Energies, 2020 This paper presents the optimal scheduling of a diesel generator and an energy storage system (ESS) while using a detailed battery ESS energy efficiency model. Optimal scheduling has been hampered to date by the nonlinearity and complexity of the battery
Rae-Kyun Kim +3 more
doaj +1 more source
Tighter Approximated MILP Formulations for Unit Commitment Problems [PDF]
IEEE Transactions on Power Systems, 2009 The short-term Unit Commitment (UC) problem in hydro-thermal power generation is a large-scale, Mixed-Integer NonLinear Program (MINLP), which is difficult to solve efficiently, especially for large-scale instances. It is possible to approximate the nonlinear objective function of the problem by means of piecewise-linear functions, so that UC can be ...
Frangioni A, Gentile C, Lacalandra F
openaire +3 more sources
International Transactions in Operational Research, EarlyView.Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia +2 more
wiley +1 more source
Exact solution algorithms for biobjective mixed integer programming problems
International Transactions in Operational Research, EarlyView.Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley +1 more source
Cost-efficient staffing under annualized hours [PDF]
, 2012 We study how flexibility in workforce capacity can be used to efficiently match capacity and demand. Flexibility in workforce capacity is introduced by the annualized hours regime.
Berden, Hubert J.J.M. +4 more
core +2 more sources
International Transactions in Operational Research, EarlyView.Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri +3 more
wiley +1 more source
A Mixed Integer Programming Approach to the Rechargeable Rover Routing Problem on Mars
Foundations of Computing and Decision SciencesIn this paper, we introduce a novel variant of the Vehicle Routing Problem (VRP), the Rechargeable Rover Routing Problem (RRRP), which addresses the routing of energy-constrained autonomous electric rovers for Martian missions.
Burzyński Wojciech, Kaleta Mariusz
doaj +1 more source
New models for the location of controversial facilities: A bilevel programming approach [PDF]
, 2019 Motivated by recent real-life applications in Location Theory in which the location decisions generate controversy, we propose a novel bilevel location model in which, on the one hand, there is a leader that chooses among a number of fixed potential ...
Labbé, Martine +2 more
core
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source