European Journal of Operational Research
Papers 10000
1 page of 1,000 pages (10k results)
#1P. J. Sydelko (University of Hull)H-Index: 3
#2Gerald MidgleyH-Index: 32
Last. Angela Espinosa (University of Hull)H-Index: 15
view all 3 authors...
ABSTRACT Wicked problems are open-ended, highly interdependent issues that cross agency, stakeholder, jurisdictional, and geopolitical boundaries. In response, there has been advocacy for interagency working. However, this confounds conventional approaches to government because policies and budgets tend to be aligned within organizational boundaries and not across them, making it difficult to bring the appropriate talent, knowledge and assets into an interagency approach to tackle the interdepen...
2 CitationsSource
#1Yuyan Wang (SDNU: Shandong Normal University)
#2Zhaoqing Yu (Shandong University of Finance and Economics)H-Index: 3
Last. Jiafu Mao (ORNL: Oak Ridge National Laboratory)H-Index: 34
view all 4 authors...
Abstract A low-carbon supply chain formed by a dominant retailer and a small and medium-sized manufacturer (SMM) is considered. Because the SMM faces the high cost pressure of adopting carbon emission reduction (CER) technologies, the retailer may take an altruistic preference for the long-term sustainability of the chain. Three decision-making models, centralized, decentralized without altruistic preference, and decentralized with altruistic preference, are constructed to compare decisions and ...
#1Flávio Keidi Miyazawa (State University of Campinas)H-Index: 17
#2Phablo F. S. Moura (UFMG: Universidade Federal de Minas Gerais)H-Index: 6
Last. Yoshiko Wakabayashi (USP: University of São Paulo)H-Index: 16
view all 4 authors...
Abstract This work addresses the balanced connected k -partition problem ( BCP k ), which is formally defined as follows. Given a connected graph G = ( V , E ) with nonnegative weights on the vertices, find a partition { V i } i = 1 k of V such that each class V i induces a connected subgraph of G , and the weight of a class with the minimum weight is as large as possible. This problem, known to be NP -hard, has been largely investigated under different approaches and perspectives: exact algorit...
#1Rita Maria Difrancesco (EADA Business School)H-Index: 3
#2Isabelle van Schilt (TU Delft: Delft University of Technology)H-Index: 1
Last. Matthias Winkenbach (MIT: Massachusetts Institute of Technology)H-Index: 10
view all 3 authors...
Abstract The explosive growth of e-commerce creates a need for increasingly responsive omni-channel fulfillment capabilities, which raises new challenges in inventory management and order fulfillment for retailers. In response to these challenges, many retailers attempt to establish so-called ship-from-store concepts, which leverage their physical store networks to fulfill online orders. In this study, we analyze the optimal setup of these in-store fulfillment processes of online orders for an o...
#1Simona Mancini (AAU: Alpen-Adria-Universität Klagenfurt)H-Index: 19
#2Margaretha Gansterer (University of Vienna)H-Index: 12
Last. Richard F. Hartl (University of Vienna)H-Index: 64
view all 3 authors...
Abstract The rising competition in the logistics sector forces companies to be more economically efficient. One of the major sources of inefficiency is the incomplete usage of available resources, such as vehicles’ capacities. Mechanism that allow to better exploit such resources by enabling carrier collaborations are on the rise. Our study examines a centrally organized multi-period collaborative vehicle routing problem, where carriers can exchange customers who have to be serviced on a regular...
Abstract This paper extends the multiplier dynamic data envelopment analysis (DEA) by using directional distance function (DDF). Based on the duality theory, a multiplier network DDF model is proposed for the dynamic system which consists of a sequence of periods linked by carryovers. The proposed multiplier dynamic model is non-oriented and is able to handle negative data that possibly exist in inputs, carryovers and outputs. The overall efficiency score calculated by the proposed multiplier dy...
#1Guiomar Martín-Herrán (University of Valladolid)H-Index: 21
#2Santiago J. Rubio (University of Valencia)H-Index: 13
Abstract This paper shows for a class of differential games that the global Stackelberg equilibrium (GSE) coincides with the feedback Stackelberg equilibrium (FSE), although the GSE assumes that the leader/regulator announces at the initial time the regulatory instrument rule she will follow for the rest of the game, while in the FSE, the regulator at any time chooses the optimal level of the regulatory instrument rate. This coincidence is based on the fact that the FSE is calculated using dynam...
#1Hamid Tikani (KNTU: K.N.Toosi University of Technology)H-Index: 4
#2Mostafa Setak (KNTU: K.N.Toosi University of Technology)H-Index: 10
Last. Emrah Demir (Cardiff University)H-Index: 5
view all 3 authors...
Abstract The Cash-in-Transit (CIT) deals with the transportation of banknotes, coins, and other valuable items. Due to the high-value density of these products, incorporating security strategies in the carrier operations is crucial. This paper proposes new CIT models involving deterministic and stochastic time-varying traffic congestion. Since risk exposure of a vehicle is proportional to the time-dependent travel time, a new formula is introduced to measure the risk of traveling. Moreover, this...
#1Lingye Zhang (Dalian Maritime University)
#2Jing Lu (Dalian Maritime University)
Last. Zaili Yang (Dalian Maritime University)H-Index: 33
view all 3 authors...
Abstract During an emergency response to a major oil spill accident, the features of the motion of the oil films affect the response decisions. A highly dynamic optimal solution is needed to tackle the continuous changes in the demand for emergency resources and transportation networks for logistics deliveries that must occur. To effectively balance the responsiveness and the total response cost in emergency operations, this paper proposes a dynamic multi-objective location-routing model to addr...
Top fields of study
Scheduling (computing)
Mathematical optimization
Operations management
Computer science
Operations research