New species, combinations, synonymies, and records of Clytini (Coleoptera: Cerambycidae)

Megacyllene (Megacyllene) cryptofrasciata n. sp. from Argentina is described and illustrated. M. quinquefasciata (Melzer, 1931), and Megacyllene rotundicollis Zajciw, 1963 are transferred from the subgenus Megacyllene Casey 1912 to Sierracyllene Tippmann, 1960. Megacyllene (SierracylZene) tafivallensis n. sp. is described from northwestern Argentina. Dexithea spixii (Laporte & Gory, 1836), and Plagionotus latreillei (Laporte & Gory, 1836) are transferred to Megacyllene (sensu stricto), excluding Dexithea, and Plagionotus from the South American fauna of Clytini. Neoclytus famelicus (Burmeister, 1865) is synonymized with N. ypsilon Chevrolat, 1861. Additional new records of Clytini from Argentina, Paraguay, and Ecuador are also presented here. A key for subgenera and species of Megacyllene is included, with distribution maps for Argentina and nearby countries

A real delivery problem dealt with Monte Carlo techniques

[EN] In this paper we use Monte Carlo Techniques to deal with a real world delivery problem of a food company in Valencia (Spain). The problem is modeled as a set of 11 instances of the well known Vehicle Routing Problem, VRP, with additional time constraints. Given that VRP is a NP-hard problem, a heuristic algorithm, based on Monte Carlo techniques, is implemented. The solution proposed by this heuristic algorithm reaches distance and money savings of about 20% and 5% respectively.This research was partially supported by MICINN, Project MTM2013-43540-P and by UPV, Project Programa de Apoyo a la Investigación y Desarrollo de la UPV PAID-06-12.S577181Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1998), A heuristic algorithm based on Monte Carlo methods for the Rural Postman Problem.Computers and Op. Research,25, No. 12, pp. 1097–1106, 1998.Fernández de Córdoba, P. and L.M. García-Raffi, E. Nieto and J.M. Sanchis Llopis (1999a), Aplicación de técnicas Monte Carlo a un problema real de Rutas de Vehículos.Anales de Ingeniería, Colombia. In press.Fernández de Córdoba, P., L.M. García-Raffi and J.M. Sanchis Llopis (1999b), A Constructive Parallel Algorithm based on Monte Carlo techniques for Routing Problems, Submitted toParallel Computers.Laporte, G. (1992), The Vehicle Routing Problem: an overview of exact and approximate algorithms,European Journal of Operations Research,59, 345.Laporte, G., M. Desrochers and Y. Nobert (1985), “Optimal Routing under Capacity and Distance Restrictions.Operations Research,33, pp. 1050–1073.Laporte G. and Y. Nobert (1987), Exact algorithms for The Vehicle Routing Problem,Surveys in Combinatorial Optimization (S. Martello, G. Laporte, M. Minoux and C. Ribeiro Eds.). North-HollandAmsterdamMayado, A. (1998), Organización de los itinerarios de la flota de camiones de reparto de una sociedad cooperativa. Optimización mediante técnicas de simulación Monte Carlo. Proyecto Fin de Carrera. E.T.S.I.I. Universidad Politécnica de Valencia

Student Chamber Music Recital, November 20, 1991

This is the concert program of the Student Chamber Music Recital on Wednesday, November 20, 1991 at 6:30 p.m., at the Marshall Room, 855 Commonwealth Avenue. Works performed were II. Andante and III. Adagio mesto from Trio in E-flat major for Violin, Horn and Piano, Op. 40 by Johannes Brahms, II. Adagio and III. Rondeau: Allegro from Duo in G major, K. 423 by Wolfgang Amadeus Mozart, and Quintet in E-flat major for Horn and Strings, K. 407 by W. A. Mozart. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund

A summary of the published data on host plants and morphology of immature stages of Australian jewel beetles (Coleoptera: Buprestidae) : with additional new records

A summary is given of the published host plant and descriptive immature stage morphology data for 671 species and 11 subspecies in 54 genera of Australian jewel beetles (Coleoptera: Buprestidae). New host data for 155 species and 3 subspecies in 17 genera including the first published data for 75 species are included

The Railway Line Frequency and Size Setting Problem

[EN] The problem studied in this paper takes as input data a set of lines forming a railway network, and an origin¿destination (OD) matrix. The OD pairs may use either the railway network or an alternative transportation mode. The objective is to determine the frequency/headway of each line as well as its number of carriages, so that the net profit of the railway network is maximized. We propose a mixed integer non-linear programming formulation for this problem. Because of the computational intractability of this model, we develop four algorithms: a mixed integer linear programming (MIP) model, a MIP-based iterative algorithm, a shortest-path based algorithm, and a local search. These four algorithms are tested and compared over a set of randomly generated instances. An application over a case study shows that only the local search heuristic is capable of dealing with large instances.This research was partly funded by the Canadian Natural Sciences and Engineering Research Council under Grant 2015-06189, by the Ministerio de Economía y Competitividad (Spain)/FEDER under projects MTM2012-37048, MTM2015-67706-P and DPI2012-36243-C02-01, and by Junta de Andalucía (Spain)/FEDER under excellence project P10-FQM-5849. Part of this research was done while Federico Perea was enjoying a research visit to CIRRELT, funded by the Universitat Politècnica de València, under program PAID-00-15. This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.De-Los-Santos, A.; Laporte, G.; Mesa, JA.; Perea Rojas Marcos, F. (2017). The Railway Line Frequency and Size Setting Problem. Public Transport. 9(1-2):33-53. https://doi.org/10.1007/s12469-017-0154-2S335391-2Albrecht T (2009) Automated timetable design for demand-oriented service on suburban railways. Public Transport 1(1):5–20Caprara A, Kroon L, Monaci M, Peeters M, Toth P (2007) Passenger Railway optimization. In: Barnhart C, Laporte G (eds) Handbooks in operations research and management science, vol 14. Transportation, chapter 3. North-Holland, Amsterdam, pp 129–187De-Los-Santos A, Laporte G, Mesa J, Perea F (2014) Simultaneous frequency and capacity setting in uncapacitated metro lines in presence of a competing mode. Transp Res Proc 3:289–298Desaulniers G, Hickman M (2007) Public transport. In: Barnhart C, Laporte G (eds) Handbook in operations research and management science, vol 14, Transportation, chapter 2. North-Holland, Amsterdam, pp 69–127Gallo M, Montella B, D’Acierno L (2011) The transit network design problem with elastic demand and internalisation of external costs: An application to rail frequency optimisation. Transp Res Part C Emerg Technol 19(6):1276–1305Laporte G, Marín A, Mesa JA, Perea F (2011) Designing robust rapid transit networks with alternative routes. J Adv Transp 45(1):54–65Marín A, García-Ródenas R (2009) Location of infrastructure in urban railway networks. Comput Oper Res 36(5):1461–1477Michaelis M, Schöbel A (2009) Integrating line planning, timetable, and vehicle scheduling: a customer oriented heuristic. Public Transport 1(3):211–232Perea F, Mesa JA, Laporte G (2014) Adding a new station and a road link to a road-rail network in the presence of modal competition. Transp Res Part B Methodol 68:1–16Schmidt M, Schöbel A (2015) The complexity of integrating passenger routing decisions in public transportation models. Networks 65(3):228–243Schmidt ME (2014) Integrating routing decisions in public transportation problems. Springer, New YorkSchöbel A (2012) Line planning in public transportation. OR Spectrum 34:491–510van Oort N, van Nes R (2009) Regularity analysis for optimizing urban transit network design. Public Transport 1(2):155–168Vuchic VR (2005) Urban transit: operations, planning, and economics. Wiley, Hoboken, New Jerse

A Student Chamber Music Concert, October 24, 1991

This is the concert program of the A Student Chamber Music Concert on Thursday, October 24, 1991 at 6:30 p.m., at the Marshall Room, 855 Commonwealth Avenue. Works performed were III. Andante--Allegretto Scherzando from Trio for Flute, Cello and Piano by Bohuslav Jan Martinu, I. Allegro from Duo in G major, K. 423 by Wolfgang Amadeus Mozart, I. Allegretto from Quintet in A major for Clarinet and Strings, K. 581 by W. A. Mozart, Five Pieces by Anthony Holborne, Canon in D major by Johann Pachelbel, I. Pastorale from Sonata for Flute, Viola and Harp by Claude Debussy, I. Sostenuto assai--Allegro ma non troppo from Piano Quartet in E-flat major, Op. 47 by Robert Schumann, and I. Allegro con fuoco from Quintet for Strings in G major, Op. 77 by Antonín Dvorák. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund