Search results for "HM"
showing 10 items of 10594 documents
La satisfacción sexual en parejas con estilos de apego seguro y ansioso
2018
Debido a la fuerte vinculación entre la satisfacción sexual, de pareja y el apego de ambos miembros de la diada, el objetivo de esta investigación fue examinar la satisfacción de pareja y sexual en las diferentes combinaciones de estilos de apego. Para ello se analizó la satisfacción sexual y de pareja en los diferentes estilos de apego de cada participante y de su pareja. En el estudio participaron 86 parejas heterosexuales, con edades entre los 20 y 60 años. Los resultados muestran que las personas seguras tienen una mayor satisfacción sexual y de pareja. Las diadas constituidas por un hombre seguro y una mujer segura son las que más satisfechas están, las mujeres seguras están menos sati…
Fuzzy Portfolio Selection Models for Dealing with Investor’s Preferences
2017
This chapter provides an overview of the authors’ previous work about dealing with investor’s preferences in the portfolio selection problem. We propose a fuzzy model for dealing with the vagueness of investor preferences on the expected return and the assumed risk, and then we consider several modifications to include additional constraints and goals.
Impact of decision horizon on post-prognostics maintenance and missions scheduling: a railways case study
2021
International audience; In this paper, we propose a study of the decision horizon duration for rolling stock mission assignment and maintenance planning in a prognostics and health management (PHM) context. The aim is to determine the best decision horizon duration that allows the con- struction of a suitable schedule that assigns railway vehicles to missions and integrates required maintenance operations accord- ing to the current and future health of the vehicles. A genetic algorithm is used to minimize the overall cost of the joint schedule as a function of the decision horizon. The results are compared to three proposed heuristics to study the influence of the resolution method on the d…
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…
Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems
2019
This article deals with new exact branch-and-price-and-cut algorithms for the solution of routing problems. Specialized methods for the pickup-and-delivery problem (PDP), the truck-and-trailer routing problem (TTRP), the periodic vehicle routing problem (PVRP) and a service network design and hub location problem (SNDHLP) are presented. We develop a new technique for the acceleration of bidirectional labeling algorithms by a dynamic choice of the merge point. Moreover, for variants of the PDP, the bidirectional labeling can be effectively applied for the first time. In the TTRP, we model the extension to a 2 days planning horizon and the consideration of a quantity-dependent transfer time. …
Does higher technical efficiency induce a higher service level? A paradox association in the context of port operations
2020
Abstract Researchers and practitioners are benchmarking technical efficiency of ports and exploring the drivers of high efficiency. Paradoxically, this study argues that high technical efficiency (TE = 1) is not always essential, but an optimal level needs to be achieved while balancing the port service level. This study applies data envelopment analysis (DEA) and free disposal hull (FDH) methods to perform efficiency rankings of 38 container terminals from 17 different ports in 12 Asian countries. Four terminals are technically efficient (TE = 1) in all frontier approaches, thereof one Bangladeshi, one Chinese, one Indian and one Vietnamese. Furthermore, this study presents a case study co…
Novel Distance Estimation Methods Using 'Stochastic Learning on the Line' Strategies
2018
In this paper, we consider the problem of Distance Estimation (DE) when the inputs are the $x$ and $y$ coordinates (or equivalently, the latitudinal and longitudinal positions) of the points under consideration. The aim of the problem is to yield an accurate value for the real (road) distance between the points specified by the latter coordinates. 1 This problem has, typically, been tackled by utilizing parametric functions called the “Distance Estimation Functions” (DEFs). The parameters are learned from the training data (i.e., the true road distances) between a subset of the points under consideration. We propose to use Learning Automata (LA)-based strategies to solve the problem. In par…
The last-mile vehicle routing problem with delivery options
2021
AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some deli…
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
2016
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods
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…