Search results for "Opera"
showing 10 items of 8665 documents
Donald Friedman's Interviews : Writers as Visual Artists
2018
With Volume 39, “Gestures and their Traces” INTERFACES, now an on-line journal, began its third iteration. In volume 40, we welcome Donald Friedman, novelist, essayist, and preeminently the author of The Writer’s Brush, Paintings, Drawings, and Sculpture by Writers, as a regular contributor to the journal. In the process of researching The Writer’s Brush, he video interviewed a number of contemporary writers; he is editing these tapes and these will begin a new feature of the journal. The fir...
Schedule-Based Integrated Intercity Bus Line Planning via Branch-and-Cut
2018
This work addresses integrated line planning for intercity bus lines, which differs in several respects from line planning in public transit. Passengers in intercity transportation decide on specific timetabled services to get to their destination. This is a contrast to an urban setting with higher frequencies, where it is generally sufficient to choose a line. Furthermore, intercity bus transportation in deregulated markets is usually characterized by fierce competition within and across modes. Customers are highly sensitive to price, time of day, duration, convenient access to stations, and service quality. Hence, bus line operators need to decide thoroughly on every single timetabled se…
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
2019
This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortes…
Branch-and-price-and-cut for a service network design and hub location problem
2015
In the context of combined road-rail freight transport, we study the integrated tactical planning of hub locations and the design of a frequency service network. We consider a number of real-world constraints such as multiple transshipments of requests at hubs, transport time limits for requests, request splitting, and outsourcing possibilities. To our knowledge, the combination of problem features we deal with has not been described before. We present a path-based model and solve it with a branch-and-price-and-cut algorithm. Computational experiments show that large realistic instances from a major German rail freight company can be solved close to optimality within one hour on a standard …
The directed profitable rural postman problem with incompatibility constraints
2017
[EN] In this paper, we study a variant of the directed rural postman problem (RPP) where profits are asso- ciated with arcs to be served, and incompatibility constraints may exist between nodes and profitable arcs leaving them. If convenient, some of the incompatibilities can be removed provided that penalties are paid. The problem looks for a tour starting and ending at the depot that maximizes the difference between collected profits and total cost as sum of traveling costs and paid penalties, while satisfying remaining incompatibilities. The problem finds application in the domain of road transportation service, and in particular in the context of horizontal collaboration among carriers …
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
Competition and cooperation for intermodal container transhipment: A network optimization approach
2018
Abstract This study presents an analysis of cross-border competition and cooperation between ports in Bangladesh and India. Nepal and Bhutan are countries without access to seaports — two landlocked countries in South Asia, depending solely on the Indian port of Kolkata for their international seaborne trade. Alternatives do exist in the Bangladeshi ports of Chittagong and Mongla but these are not exploited, in spite of trade agreements that allow access to a third country's port, and/or crossing the land of a third, intermediate, country. We formulate a mixed integer linear programming optimization model to find the optimum economic benefit of port users (serving Bhutan, Nepal and Northeas…
Modéliser le rôle des paysages dans les choix d'itinéraires pédestres
2008
Actuellement, la marche a pied suscite un regain d'interet comme mode de transport complementaire. Dans le cadre de cet article, nous partons de l'hypothese que l'adaptation de l'environnement urbain aux attentes des pietons, notamment d'un point de vue paysager, est une etape essentielle de la revalorisation de ce mode de deplacement. A cette fin, nous proposons une demarche permettant de decrire les comportements pedestres et d'identifier les preferences paysageres des pietons dans les villes de Besancon et de Lille. La methode d'analyse se fonde sur les modeles de choix discret, couramment utilises dans la modelisation des choix individuels. Celle-ci permet de mesurer, de maniere desagre…
History of Data Centre Development
2012
International audience; Computers are used to solve different problems. For solving these problems computer software and hardware are used, but for operations of those computing facilities a Data Centre is necessary. Therefore, development of the data centre is subordinated to solvable tasks and computing resources. We are studying the history of data centres’ development, taking into consideration an understanding of this. In the beginning of the computer era computers were installed in computing centres, because all computing centres have defined requirements according to whom their operation is intended for. Even though the concept of ‘data centre’ itself has been used since the 1990s, t…
Acquisition of Generic Competencies Through Project Simulation in Translation Studies
2017
Motivated by the research in several international and interdisciplinary initiatives, for example, P21 Partnership for 21st Century Learning or the Collegiate Learning Assessment instruments, we seek for a scalable and measureable set of generic competencies for translation studies. Up to now, the acquisition of competencies in translation studies has primarily been operationalized by implementing authentic projects in higher education classes using socio-constructivist approaches. This results in a hybridization of subject-specific competencies and generic competencies in translator education. Because of the necessity to focus on the acquisition of generic competencies as a primary learnin…